./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/lcp.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/verifythis/lcp.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 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 15:24:02,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 15:24:02,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 15:24:02,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 15:24:02,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 15:24:02,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 15:24:02,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 15:24:02,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 15:24:02,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 15:24:02,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 15:24:02,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 15:24:02,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 15:24:02,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 15:24:02,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 15:24:02,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 15:24:02,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 15:24:02,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 15:24:02,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 15:24:02,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 15:24:02,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 15:24:02,420 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 15:24:02,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 15:24:02,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 15:24:02,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 15:24:02,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 15:24:02,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 15:24:02,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 15:24:02,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 15:24:02,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 15:24:02,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 15:24:02,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 15:24:02,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 15:24:02,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 15:24:02,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 15:24:02,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 15:24:02,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 15:24:02,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 15:24:02,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 15:24:02,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 15:24:02,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 15:24:02,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 15:24:02,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 15:24:02,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 15:24:02,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 15:24:02,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 15:24:02,466 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 15:24:02,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 15:24:02,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 15:24:02,467 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 15:24:02,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 15:24:02,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 15:24:02,468 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 15:24:02,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 15:24:02,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 15:24:02,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 15:24:02,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 15:24:02,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 15:24:02,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 15:24:02,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 15:24:02,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 15:24:02,470 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 15:24:02,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 15:24:02,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 15:24:02,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 15:24:02,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 15:24:02,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 15:24:02,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 15:24:02,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:24:02,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 15:24:02,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 15:24:02,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 15:24:02,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 15:24:02,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 15:24:02,474 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 15:24:02,474 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 15:24:02,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 15:24:02,475 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 -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a [2022-07-19 15:24:02,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 15:24:02,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 15:24:02,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 15:24:02,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 15:24:02,745 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 15:24:02,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2022-07-19 15:24:02,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2cce108/7413474ad18b4a68a50d31969dde5fb1/FLAG7ce946833 [2022-07-19 15:24:03,162 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 15:24:03,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2022-07-19 15:24:03,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2cce108/7413474ad18b4a68a50d31969dde5fb1/FLAG7ce946833 [2022-07-19 15:24:03,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2cce108/7413474ad18b4a68a50d31969dde5fb1 [2022-07-19 15:24:03,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 15:24:03,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 15:24:03,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 15:24:03,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 15:24:03,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 15:24:03,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467eb6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03, skipping insertion in model container [2022-07-19 15:24:03,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 15:24:03,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 15:24:03,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c[515,528] [2022-07-19 15:24:03,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:24:03,437 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 15:24:03,451 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/verifythis/lcp.c[515,528] [2022-07-19 15:24:03,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:24:03,488 INFO L208 MainTranslator]: Completed translation [2022-07-19 15:24:03,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03 WrapperNode [2022-07-19 15:24:03,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 15:24:03,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 15:24:03,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 15:24:03,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 15:24:03,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,539 INFO L137 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2022-07-19 15:24:03,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 15:24:03,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 15:24:03,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 15:24:03,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 15:24:03,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 15:24:03,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 15:24:03,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 15:24:03,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 15:24:03,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (1/1) ... [2022-07-19 15:24:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:24:03,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:03,607 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 15:24:03,609 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 15:24:03,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 15:24:03,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 15:24:03,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 15:24:03,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 15:24:03,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 15:24:03,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 15:24:03,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 15:24:03,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 15:24:03,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 15:24:03,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 15:24:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 15:24:03,751 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 15:24:03,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 15:24:03,942 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 15:24:03,948 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 15:24:03,948 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 15:24:03,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:24:03 BoogieIcfgContainer [2022-07-19 15:24:03,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 15:24:03,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 15:24:03,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 15:24:03,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 15:24:03,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 03:24:03" (1/3) ... [2022-07-19 15:24:03,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e64ee95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:24:03, skipping insertion in model container [2022-07-19 15:24:03,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:03" (2/3) ... [2022-07-19 15:24:03,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e64ee95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:24:03, skipping insertion in model container [2022-07-19 15:24:03,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:24:03" (3/3) ... [2022-07-19 15:24:03,957 INFO L111 eAbstractionObserver]: Analyzing ICFG lcp.c [2022-07-19 15:24:03,970 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 15:24:03,971 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 15:24:04,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 15:24:04,026 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@4dc24cfd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53839625 [2022-07-19 15:24:04,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 15:24:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 15:24:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 15:24:04,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:04,039 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:24:04,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash 867982546, now seen corresponding path program 1 times [2022-07-19 15:24:04,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:04,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235436160] [2022-07-19 15:24:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:04,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:24:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 15:24:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:24:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235436160] [2022-07-19 15:24:04,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235436160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:04,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:24:04,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 15:24:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464902399] [2022-07-19 15:24:04,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:04,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 15:24:04,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:04,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 15:24:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 15:24:04,279 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 15:24:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:04,300 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-07-19 15:24:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 15:24:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-19 15:24:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:04,308 INFO L225 Difference]: With dead ends: 63 [2022-07-19 15:24:04,308 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 15:24:04,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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 15:24:04,316 INFO L413 NwaCegarLoop]: 38 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, 38 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 15:24:04,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:24:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 15:24:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 15:24:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:24:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-19 15:24:04,355 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2022-07-19 15:24:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:04,355 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-19 15:24:04,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 15:24:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-19 15:24:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 15:24:04,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:04,359 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:24:04,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 15:24:04,360 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1785702985, now seen corresponding path program 1 times [2022-07-19 15:24:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:04,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071332571] [2022-07-19 15:24:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:04,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:24:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 15:24:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:24:04,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:04,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071332571] [2022-07-19 15:24:04,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071332571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:04,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:24:04,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 15:24:04,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631623309] [2022-07-19 15:24:04,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:04,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:24:04,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:04,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:24:04,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:24:04,552 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 15:24:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:04,692 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-07-19 15:24:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:24:04,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-07-19 15:24:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:04,694 INFO L225 Difference]: With dead ends: 58 [2022-07-19 15:24:04,694 INFO L226 Difference]: Without dead ends: 40 [2022-07-19 15:24:04,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 15:24:04,696 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:04,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:24:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-19 15:24:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-07-19 15:24:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:24:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-19 15:24:04,705 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 30 [2022-07-19 15:24:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:04,706 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-19 15:24:04,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 15:24:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-19 15:24:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 15:24:04,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:04,707 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:24:04,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 15:24:04,707 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash 774585735, now seen corresponding path program 1 times [2022-07-19 15:24:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:04,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149027621] [2022-07-19 15:24:04,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:04,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:24:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 15:24:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:24:04,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:04,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149027621] [2022-07-19 15:24:04,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149027621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:04,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:24:04,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 15:24:04,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89822879] [2022-07-19 15:24:04,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:04,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 15:24:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:04,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 15:24:04,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:24:04,889 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 15:24:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:05,028 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-07-19 15:24:05,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 15:24:05,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-07-19 15:24:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:05,032 INFO L225 Difference]: With dead ends: 37 [2022-07-19 15:24:05,032 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 15:24:05,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-19 15:24:05,035 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:05,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 113 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:24:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 15:24:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-19 15:24:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:24:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-19 15:24:05,054 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 30 [2022-07-19 15:24:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:05,054 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-19 15:24:05,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 15:24:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-19 15:24:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 15:24:05,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:05,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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-07-19 15:24:05,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 15:24:05,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:05,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2142420270, now seen corresponding path program 1 times [2022-07-19 15:24:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:05,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201825388] [2022-07-19 15:24:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:24:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 15:24:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 15:24:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:24:05,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:05,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201825388] [2022-07-19 15:24:05,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201825388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:05,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:24:05,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 15:24:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350934668] [2022-07-19 15:24:05,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:05,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 15:24:05,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:05,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 15:24:05,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:24:05,278 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 15:24:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:05,479 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-07-19 15:24:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:24:05,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-07-19 15:24:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:05,482 INFO L225 Difference]: With dead ends: 46 [2022-07-19 15:24:05,482 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 15:24:05,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-19 15:24:05,489 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:05,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 134 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:24:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 15:24:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-19 15:24:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:24:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-19 15:24:05,503 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 37 [2022-07-19 15:24:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:05,504 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-19 15:24:05,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 15:24:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-19 15:24:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 15:24:05,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:05,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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-07-19 15:24:05,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 15:24:05,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 874062527, now seen corresponding path program 1 times [2022-07-19 15:24:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758251555] [2022-07-19 15:24:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:24:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 15:24:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 15:24:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:24:05,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:05,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758251555] [2022-07-19 15:24:05,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758251555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:05,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31931189] [2022-07-19 15:24:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:05,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:24:05,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:05,634 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 15:24:05,661 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 15:24:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 15:24:05,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:05,777 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 7 treesize of output 6 [2022-07-19 15:24:07,806 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1| Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1|))) is different from true [2022-07-19 15:24:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 15:24:07,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:24:11,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31931189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:11,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:24:11,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-07-19 15:24:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152062826] [2022-07-19 15:24:11,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:24:11,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 15:24:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:11,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 15:24:11,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=54, Unknown=2, NotChecked=14, Total=90 [2022-07-19 15:24:11,975 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 15:24:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:12,082 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-07-19 15:24:12,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 15:24:12,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 40 [2022-07-19 15:24:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:12,084 INFO L225 Difference]: With dead ends: 59 [2022-07-19 15:24:12,085 INFO L226 Difference]: Without dead ends: 39 [2022-07-19 15:24:12,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=41, Invalid=93, Unknown=2, NotChecked=20, Total=156 [2022-07-19 15:24:12,086 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:12,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 84 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-07-19 15:24:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-19 15:24:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-19 15:24:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:24:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-07-19 15:24:12,095 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 40 [2022-07-19 15:24:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:12,097 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-07-19 15:24:12,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 15:24:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-07-19 15:24:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 15:24:12,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:12,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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-07-19 15:24:12,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 15:24:12,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:24:12,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1296764353, now seen corresponding path program 1 times [2022-07-19 15:24:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:12,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525122269] [2022-07-19 15:24:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:12,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:24:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:12,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 15:24:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 15:24:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 15:24:12,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:12,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525122269] [2022-07-19 15:24:12,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525122269] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:12,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026353810] [2022-07-19 15:24:12,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:12,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:24:12,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:12,513 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 15:24:12,515 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 15:24:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:12,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 15:24:12,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 15:24:12,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:24:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 15:24:13,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026353810] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:24:13,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:24:13,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-19 15:24:13,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204456367] [2022-07-19 15:24:13,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:24:13,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 15:24:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:13,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 15:24:13,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 15:24:13,049 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 15:24:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:13,184 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-07-19 15:24:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:24:13,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-07-19 15:24:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:13,185 INFO L225 Difference]: With dead ends: 40 [2022-07-19 15:24:13,185 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 15:24:13,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-19 15:24:13,186 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:13,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 105 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:24:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 15:24:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 15:24:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-07-19 15:24:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 15:24:13,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-07-19 15:24:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:13,188 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 15:24:13,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 15:24:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 15:24:13,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 15:24:13,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 15:24:13,220 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 15:24:13,417 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,SelfDestructingSolverStorable5 [2022-07-19 15:24:13,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 15:24:13,837 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 15:24:13,838 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-07-19 15:24:13,838 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)) (.cse10 (* |ULTIMATE.start_check_~i~0#1| 4)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|)) (.cse1 (= .cse2 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= (select .cse9 (+ |ULTIMATE.start_check_~a#1.offset| (* 4 |ULTIMATE.start_check_~x#1|) .cse10)) 0)) (.cse4 (<= |ULTIMATE.start_lcp_~x#1| |ULTIMATE.start_main_~x~0#1|)) (.cse5 (= .cse2 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))) (.cse6 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|)) (.cse7 (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~x~0#1|)))) (.cse8 (= (select .cse9 (+ (* 4 |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~a#1.offset| .cse10)) 0))) (or (and (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|))) .cse0 .cse1 (or (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|)) (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|))) (= .cse2 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= |ULTIMATE.start_check_~l#1| 0) .cse1 (or (<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~x#1|) (<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~y#1|)) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_lcp_~l~0#1| 0) .cse7 .cse8 (= |ULTIMATE.start_lcp_#res#1| 0))))) [2022-07-19 15:24:13,838 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-07-19 15:24:13,838 INFO L895 garLoopResultBuilder]: At program point L21(lines 16 22) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|)) (.cse1 (= .cse6 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (<= |ULTIMATE.start_lcp_~x#1| |ULTIMATE.start_main_~x~0#1|)) (.cse3 (= .cse6 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))) (.cse4 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|)) (.cse5 (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~x~0#1|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_lcp_~l~0#1| 0) .cse5 (= |ULTIMATE.start_lcp_#res#1| 0)) (and (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|))) .cse0 .cse1 (= .cse6 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) .cse2 .cse3 .cse4 .cse5)))) [2022-07-19 15:24:13,838 INFO L902 garLoopResultBuilder]: At program point L48(lines 35 49) the Hoare annotation is: true [2022-07-19 15:24:13,838 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: false [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)) (.cse11 (* |ULTIMATE.start_check_~i~0#1| 4)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|)) (.cse1 (= .cse2 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= (select .cse10 (+ |ULTIMATE.start_check_~a#1.offset| (* 4 |ULTIMATE.start_check_~x#1|) .cse11)) 0)) (.cse4 (<= |ULTIMATE.start_lcp_~x#1| |ULTIMATE.start_main_~x~0#1|)) (.cse5 (= .cse2 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))) (.cse6 (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_#t~mem10#1|)) (.cse7 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|)) (.cse8 (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~x~0#1|)))) (.cse9 (= (select .cse10 (+ (* 4 |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~a#1.offset| .cse11)) 0))) (or (and (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|))) .cse0 .cse1 (or (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|)) (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|))) (= .cse2 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= |ULTIMATE.start_check_~l#1| 0) .cse1 (or (<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~x#1|) (<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~y#1|)) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_lcp_~l~0#1| 0) .cse8 .cse9 (= |ULTIMATE.start_lcp_#res#1| 0))))) [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 33) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point L18-1(line 18) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L899 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2022-07-19 15:24:13,839 INFO L895 garLoopResultBuilder]: At program point L18-5(lines 18 20) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (<= |ULTIMATE.start_lcp_~x#1| |ULTIMATE.start_main_~x~0#1|) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|))) [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2022-07-19 15:24:13,840 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)))) [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point L43-1(line 43) no Hoare annotation was computed. [2022-07-19 15:24:13,840 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-07-19 15:24:13,840 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 14) the Hoare annotation is: true [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point L13-3(lines 12 14) no Hoare annotation was computed. [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 14) no Hoare annotation was computed. [2022-07-19 15:24:13,840 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-07-19 15:24:13,843 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-19 15:24:13,845 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 15:24:13,850 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:263) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:449) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 15:24:13,853 INFO L158 Benchmark]: Toolchain (without parser) took 10672.15ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 46.9MB in the beginning and 48.8MB in the end (delta: -1.9MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2022-07-19 15:24:13,853 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory was 63.2MB in the beginning and 63.2MB in the end (delta: 50.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:24:13,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.80ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 46.6MB in the beginning and 85.5MB in the end (delta: -38.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 15:24:13,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.81ms. Allocated memory is still 115.3MB. Free memory was 85.5MB in the beginning and 83.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:24:13,854 INFO L158 Benchmark]: Boogie Preprocessor took 33.67ms. Allocated memory is still 115.3MB. Free memory was 83.7MB in the beginning and 82.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 15:24:13,854 INFO L158 Benchmark]: RCFGBuilder took 375.48ms. Allocated memory is still 115.3MB. Free memory was 82.4MB in the beginning and 69.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 15:24:13,855 INFO L158 Benchmark]: TraceAbstraction took 9900.94ms. Allocated memory is still 115.3MB. Free memory was 69.4MB in the beginning and 48.8MB in the end (delta: 20.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-07-19 15:24:13,857 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.20ms. Allocated memory is still 88.1MB. Free memory was 63.2MB in the beginning and 63.2MB in the end (delta: 50.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.80ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 46.6MB in the beginning and 85.5MB in the end (delta: -38.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.81ms. Allocated memory is still 115.3MB. Free memory was 85.5MB in the beginning and 83.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.67ms. Allocated memory is still 115.3MB. Free memory was 83.7MB in the beginning and 82.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 375.48ms. Allocated memory is still 115.3MB. Free memory was 82.4MB in the beginning and 69.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9900.94ms. Allocated memory is still 115.3MB. Free memory was 69.4MB in the beginning and 48.8MB in the end (delta: 20.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 43 IncrementalHoareTripleChecker+Unchecked, 391 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 165 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=5, InterpolantAutomatonStates: 39, 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, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 26 PreInvPairs, 37 NumberOfFragments, 476 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 444 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 316 ConstructedInterpolants, 4 QuantifiedInterpolants, 1221 SizeOfPredicates, 33 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 125/135 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:263) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 15:24:13,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/verifythis/lcp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 15:24:15,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 15:24:15,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 15:24:15,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 15:24:15,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 15:24:15,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 15:24:15,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 15:24:15,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 15:24:15,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 15:24:15,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 15:24:15,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 15:24:15,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 15:24:15,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 15:24:15,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 15:24:15,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 15:24:15,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 15:24:15,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 15:24:15,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 15:24:15,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 15:24:15,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 15:24:15,926 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 15:24:15,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 15:24:15,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 15:24:15,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 15:24:15,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 15:24:15,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 15:24:15,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 15:24:15,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 15:24:15,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 15:24:15,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 15:24:15,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 15:24:15,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 15:24:15,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 15:24:15,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 15:24:15,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 15:24:15,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 15:24:15,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 15:24:15,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 15:24:15,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 15:24:15,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 15:24:15,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 15:24:15,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 15:24:15,960 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 15:24:15,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 15:24:15,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 15:24:15,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 15:24:15,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 15:24:15,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 15:24:15,995 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 15:24:15,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 15:24:15,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 15:24:15,996 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 15:24:15,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 15:24:15,997 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 15:24:15,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 15:24:15,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 15:24:15,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 15:24:15,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 15:24:15,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 15:24:15,998 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 15:24:15,999 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 15:24:15,999 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 15:24:15,999 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 15:24:15,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 15:24:15,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 15:24:16,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 15:24:16,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 15:24:16,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 15:24:16,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 15:24:16,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:24:16,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 15:24:16,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 15:24:16,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 15:24:16,002 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 15:24:16,003 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 15:24:16,003 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 15:24:16,003 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 15:24:16,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 15:24:16,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 15:24:16,004 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a [2022-07-19 15:24:16,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 15:24:16,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 15:24:16,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 15:24:16,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 15:24:16,351 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 15:24:16,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2022-07-19 15:24:16,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a2fafa4/0674d347ff5e439cafd831e41b3f0d5d/FLAGabdf63c31 [2022-07-19 15:24:16,866 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 15:24:16,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2022-07-19 15:24:16,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a2fafa4/0674d347ff5e439cafd831e41b3f0d5d/FLAGabdf63c31 [2022-07-19 15:24:16,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a2fafa4/0674d347ff5e439cafd831e41b3f0d5d [2022-07-19 15:24:16,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 15:24:16,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 15:24:16,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 15:24:16,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 15:24:16,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 15:24:16,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:24:16" (1/1) ... [2022-07-19 15:24:16,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@daa79d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:16, skipping insertion in model container [2022-07-19 15:24:16,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:24:16" (1/1) ... [2022-07-19 15:24:16,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 15:24:16,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 15:24:17,041 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/verifythis/lcp.c[515,528] [2022-07-19 15:24:17,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:24:17,075 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 15:24:17,104 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/verifythis/lcp.c[515,528] [2022-07-19 15:24:17,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:24:17,144 INFO L208 MainTranslator]: Completed translation [2022-07-19 15:24:17,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17 WrapperNode [2022-07-19 15:24:17,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 15:24:17,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 15:24:17,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 15:24:17,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 15:24:17,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,187 INFO L137 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2022-07-19 15:24:17,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 15:24:17,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 15:24:17,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 15:24:17,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 15:24:17,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 15:24:17,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 15:24:17,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 15:24:17,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 15:24:17,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (1/1) ... [2022-07-19 15:24:17,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:24:17,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:17,241 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 15:24:17,245 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 15:24:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 15:24:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 15:24:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 15:24:17,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 15:24:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 15:24:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 15:24:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 15:24:17,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 15:24:17,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 15:24:17,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 15:24:17,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 15:24:17,342 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 15:24:17,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 15:24:17,521 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 15:24:17,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 15:24:17,527 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 15:24:17,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:24:17 BoogieIcfgContainer [2022-07-19 15:24:17,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 15:24:17,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 15:24:17,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 15:24:17,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 15:24:17,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 03:24:16" (1/3) ... [2022-07-19 15:24:17,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd4f0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:24:17, skipping insertion in model container [2022-07-19 15:24:17,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:17" (2/3) ... [2022-07-19 15:24:17,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd4f0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:24:17, skipping insertion in model container [2022-07-19 15:24:17,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:24:17" (3/3) ... [2022-07-19 15:24:17,546 INFO L111 eAbstractionObserver]: Analyzing ICFG lcp.c [2022-07-19 15:24:17,558 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 15:24:17,559 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 15:24:17,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 15:24:17,664 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@266be97, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ad35743 [2022-07-19 15:24:17,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 15:24:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 15:24:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 15:24:17,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:17,678 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:24:17,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash 867982546, now seen corresponding path program 1 times [2022-07-19 15:24:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 15:24:17,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071862314] [2022-07-19 15:24:17,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:17,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 15:24:17,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 15:24:17,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 15:24:17,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 15:24:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:17,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 15:24:17,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 15:24:17,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:24:17,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 15:24:17,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071862314] [2022-07-19 15:24:17,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071862314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:17,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:24:17,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 15:24:17,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765816622] [2022-07-19 15:24:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:17,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 15:24:17,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 15:24:17,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 15:24:17,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 15:24:17,946 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 15:24:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:17,973 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-07-19 15:24:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 15:24:17,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-19 15:24:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:17,983 INFO L225 Difference]: With dead ends: 63 [2022-07-19 15:24:17,983 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 15:24:17,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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 15:24:18,004 INFO L413 NwaCegarLoop]: 38 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, 38 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 15:24:18,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:24:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 15:24:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 15:24:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:24:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-19 15:24:18,047 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2022-07-19 15:24:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:18,048 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-19 15:24:18,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 15:24:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-19 15:24:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 15:24:18,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:18,054 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:24:18,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 15:24:18,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 15:24:18,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:18,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:18,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1785702985, now seen corresponding path program 1 times [2022-07-19 15:24:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 15:24:18,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011348979] [2022-07-19 15:24:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:18,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 15:24:18,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 15:24:18,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 15:24:18,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 15:24:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:18,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 15:24:18,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 15:24:18,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:24:18,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 15:24:18,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011348979] [2022-07-19 15:24:18,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011348979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:18,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:24:18,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 15:24:18,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24317854] [2022-07-19 15:24:18,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:18,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 15:24:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 15:24:18,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 15:24:18,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:24:18,477 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 15:24:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:18,646 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-07-19 15:24:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:24:18,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-07-19 15:24:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:18,648 INFO L225 Difference]: With dead ends: 45 [2022-07-19 15:24:18,649 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 15:24:18,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-19 15:24:18,650 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:18,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:24:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 15:24:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-19 15:24:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:24:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-19 15:24:18,656 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 30 [2022-07-19 15:24:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:18,658 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-19 15:24:18,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 15:24:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-19 15:24:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 15:24:18,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:18,659 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:24:18,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 15:24:18,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 15:24:18,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash -964575686, now seen corresponding path program 1 times [2022-07-19 15:24:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 15:24:18,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406250171] [2022-07-19 15:24:18,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:18,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 15:24:18,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 15:24:18,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 15:24:18,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 15:24:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:18,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 15:24:18,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:19,498 INFO L356 Elim1Store]: treesize reduction 90, result has 7.2 percent of original size [2022-07-19 15:24:19,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 16 [2022-07-19 15:24:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 15:24:19,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:24:24,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 15:24:24,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406250171] [2022-07-19 15:24:24,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406250171] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:24,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [255905087] [2022-07-19 15:24:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 15:24:24,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 15:24:24,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 15:24:24,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-07-19 15:24:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:24,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 15:24:24,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:24,343 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 7 treesize of output 6 [2022-07-19 15:24:26,443 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1|))) is different from true [2022-07-19 15:24:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 15:24:26,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:24:33,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [255905087] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:33,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:24:33,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 20 [2022-07-19 15:24:33,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217293516] [2022-07-19 15:24:33,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:24:33,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 15:24:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 15:24:33,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 15:24:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=541, Unknown=6, NotChecked=46, Total=650 [2022-07-19 15:24:33,642 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 20 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 15:24:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:53,522 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-07-19 15:24:53,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 15:24:53,523 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 33 [2022-07-19 15:24:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:53,525 INFO L225 Difference]: With dead ends: 71 [2022-07-19 15:24:53,525 INFO L226 Difference]: Without dead ends: 53 [2022-07-19 15:24:53,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=219, Invalid=1495, Unknown=12, NotChecked=80, Total=1806 [2022-07-19 15:24:53,528 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:53,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 225 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 370 Invalid, 0 Unknown, 79 Unchecked, 0.6s Time] [2022-07-19 15:24:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-19 15:24:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2022-07-19 15:24:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 15:24:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-19 15:24:53,537 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 33 [2022-07-19 15:24:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:53,538 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-19 15:24:53,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 15:24:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-19 15:24:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 15:24:53,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:53,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:24:53,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-07-19 15:24:53,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 15:24:53,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 15:24:53,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash -436474905, now seen corresponding path program 1 times [2022-07-19 15:24:53,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 15:24:53,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514153719] [2022-07-19 15:24:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:53,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 15:24:53,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 15:24:53,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 15:24:53,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 15:24:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:54,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-19 15:24:54,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:57,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 15:24:57,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 15:24:57,622 INFO L356 Elim1Store]: treesize reduction 144, result has 32.4 percent of original size [2022-07-19 15:24:57,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 81 [2022-07-19 15:24:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:24:57,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:02,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 15:25:02,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514153719] [2022-07-19 15:25:02,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514153719] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:02,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [802872649] [2022-07-19 15:25:02,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:25:02,592 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 15:25:02,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 15:25:02,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 15:25:02,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-07-19 15:25:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:02,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 15:25:02,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:02,684 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 7 treesize of output 6 [2022-07-19 15:25:04,872 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|))) is different from true [2022-07-19 15:25:07,108 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_3|))) is different from true [2022-07-19 15:25:07,201 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 35 treesize of output 29 [2022-07-19 15:25:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2022-07-19 15:25:07,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:09,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [802872649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:09,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:25:09,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 27 [2022-07-19 15:25:09,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493696782] [2022-07-19 15:25:09,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:09,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-19 15:25:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 15:25:09,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-19 15:25:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=798, Unknown=5, NotChecked=114, Total=992 [2022-07-19 15:25:09,512 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-19 15:25:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:25:20,893 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-19 15:25:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-19 15:25:20,894 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2022-07-19 15:25:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:25:20,896 INFO L225 Difference]: With dead ends: 69 [2022-07-19 15:25:20,897 INFO L226 Difference]: Without dead ends: 67 [2022-07-19 15:25:20,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=189, Invalid=1976, Unknown=5, NotChecked=182, Total=2352 [2022-07-19 15:25:20,899 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 15:25:20,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 403 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 337 Unchecked, 0.3s Time] [2022-07-19 15:25:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-19 15:25:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-07-19 15:25:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 15:25:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-07-19 15:25:20,910 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 36 [2022-07-19 15:25:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:25:20,911 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-07-19 15:25:20,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-19 15:25:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-07-19 15:25:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 15:25:20,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:25:20,912 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:25:20,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-07-19 15:25:21,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 15:25:21,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 15:25:21,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:25:21,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:25:21,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2024822807, now seen corresponding path program 2 times [2022-07-19 15:25:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 15:25:21,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35381640] [2022-07-19 15:25:21,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:25:21,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 15:25:21,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 15:25:21,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 15:25:21,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 15:25:21,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:25:21,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:25:21,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 15:25:21,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 15:25:21,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:25:21,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 15:25:21,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35381640] [2022-07-19 15:25:21,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35381640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:25:21,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:25:21,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 15:25:21,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627682505] [2022-07-19 15:25:21,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:25:21,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 15:25:21,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 15:25:21,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 15:25:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 15:25:21,393 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 15:25:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:25:21,418 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-07-19 15:25:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 15:25:21,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-07-19 15:25:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:25:21,423 INFO L225 Difference]: With dead ends: 93 [2022-07-19 15:25:21,424 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 15:25:21,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 15:25:21,425 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:25:21,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:25:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 15:25:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-19 15:25:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 44 states have internal predecessors, (46), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 15:25:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-07-19 15:25:21,433 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 36 [2022-07-19 15:25:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:25:21,433 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-07-19 15:25:21,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 15:25:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-07-19 15:25:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 15:25:21,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:25:21,435 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:25:21,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 15:25:21,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 15:25:21,644 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:25:21,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:25:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1337034520, now seen corresponding path program 3 times [2022-07-19 15:25:21,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 15:25:21,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986168116] [2022-07-19 15:25:21,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:25:21,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 15:25:21,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 15:25:21,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 15:25:21,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 15:25:21,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 15:25:21,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:25:21,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 15:25:21,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:21,764 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 7 treesize of output 6 [2022-07-19 15:25:23,799 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3|))) is different from true [2022-07-19 15:25:25,881 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4|))) is different from true [2022-07-19 15:25:25,907 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 35 treesize of output 29 [2022-07-19 15:25:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 4 not checked. [2022-07-19 15:25:25,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:28,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 15:25:28,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986168116] [2022-07-19 15:25:28,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986168116] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:28,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1515451329] [2022-07-19 15:25:28,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:25:28,095 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 15:25:28,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 15:25:28,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 15:25:28,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-07-19 15:25:28,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 15:25:28,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:25:28,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 15:25:28,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:28,212 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 7 treesize of output 6 [2022-07-19 15:25:30,228 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4|))) is different from true [2022-07-19 15:25:32,303 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|))) is different from true [2022-07-19 15:25:32,335 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 35 treesize of output 29 [2022-07-19 15:25:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 4 not checked. [2022-07-19 15:25:32,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:32,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1515451329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:32,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:25:32,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2022-07-19 15:25:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631496844] [2022-07-19 15:25:32,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:32,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 15:25:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 15:25:32,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 15:25:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=110, Unknown=5, NotChecked=92, Total=240 [2022-07-19 15:25:32,391 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 15:25:34,443 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4|)))) is different from true [2022-07-19 15:25:36,494 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4|)))) is different from true [2022-07-19 15:25:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:25:36,559 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-07-19 15:25:36,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 15:25:36,560 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-07-19 15:25:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:25:36,561 INFO L225 Difference]: With dead ends: 61 [2022-07-19 15:25:36,561 INFO L226 Difference]: Without dead ends: 57 [2022-07-19 15:25:36,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=58, Invalid=199, Unknown=7, NotChecked=198, Total=462 [2022-07-19 15:25:36,563 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:25:36,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 131 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 183 Unchecked, 0.1s Time] [2022-07-19 15:25:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-19 15:25:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2022-07-19 15:25:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:25:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-07-19 15:25:36,572 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-07-19 15:25:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:25:36,573 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-07-19 15:25:36,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 15:25:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-07-19 15:25:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 15:25:36,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:25:36,574 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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-07-19 15:25:36,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 15:25:36,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-07-19 15:25:36,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-19 15:25:36,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:25:36,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:25:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1296764353, now seen corresponding path program 1 times [2022-07-19 15:25:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 15:25:36,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127018380] [2022-07-19 15:25:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:25:36,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 15:25:36,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 15:25:36,991 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 15:25:36,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 15:25:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:37,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 15:25:37,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 15:25:38,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:25:40,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 15:25:40,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127018380] [2022-07-19 15:25:40,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127018380] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:25:40,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:25:40,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2022-07-19 15:25:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271398851] [2022-07-19 15:25:40,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:40,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 15:25:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 15:25:40,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 15:25:40,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-19 15:25:40,632 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 15:25:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:25:48,723 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-07-19 15:25:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-19 15:25:48,725 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 40 [2022-07-19 15:25:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:25:48,726 INFO L225 Difference]: With dead ends: 80 [2022-07-19 15:25:48,726 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 15:25:48,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=373, Invalid=1187, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 15:25:48,728 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 96 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 15:25:48,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 216 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-19 15:25:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 15:25:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-07-19 15:25:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:25:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-07-19 15:25:48,736 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 40 [2022-07-19 15:25:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:25:48,737 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-07-19 15:25:48,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 15:25:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-07-19 15:25:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 15:25:48,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:25:48,738 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 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-07-19 15:25:48,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 15:25:48,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 15:25:48,948 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:25:48,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:25:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1272141330, now seen corresponding path program 2 times [2022-07-19 15:25:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 15:25:48,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377201241] [2022-07-19 15:25:48,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:25:48,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 15:25:48,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 15:25:48,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 15:25:48,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 15:25:49,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:25:49,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:25:49,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-19 15:25:49,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 15:25:50,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:25:54,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 15:25:54,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377201241] [2022-07-19 15:25:54,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377201241] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:25:54,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:25:54,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2022-07-19 15:25:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43269811] [2022-07-19 15:25:54,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:54,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 15:25:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 15:25:54,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 15:25:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2022-07-19 15:25:54,334 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 15:26:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:26:43,760 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2022-07-19 15:26:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-19 15:26:43,762 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 49 [2022-07-19 15:26:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:26:43,763 INFO L225 Difference]: With dead ends: 122 [2022-07-19 15:26:43,763 INFO L226 Difference]: Without dead ends: 69 [2022-07-19 15:26:43,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=1012, Invalid=3410, Unknown=0, NotChecked=0, Total=4422 [2022-07-19 15:26:43,765 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 237 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-19 15:26:43,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 228 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-19 15:26:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-19 15:26:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-07-19 15:26:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:26:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-07-19 15:26:43,776 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 49 [2022-07-19 15:26:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:26:43,776 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-07-19 15:26:43,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 15:26:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-07-19 15:26:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 15:26:43,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:26:43,778 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 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-07-19 15:26:43,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-19 15:26:43,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 15:26:43,984 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:26:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:26:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2075652366, now seen corresponding path program 3 times [2022-07-19 15:26:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 15:26:43,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807567440] [2022-07-19 15:26:43,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:26:43,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 15:26:43,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 15:26:43,986 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 15:26:43,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-19 15:26:44,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-19 15:26:44,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:26:44,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 15:26:44,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:26:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-19 15:26:45,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:26:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-19 15:26:49,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 15:26:49,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807567440] [2022-07-19 15:26:49,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807567440] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:26:49,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:26:49,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-19 15:26:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408082153] [2022-07-19 15:26:49,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:26:49,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 15:26:49,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 15:26:49,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 15:26:49,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-19 15:26:49,024 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 15:26:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:26:50,194 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-07-19 15:26:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 15:26:50,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2022-07-19 15:26:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:26:50,196 INFO L225 Difference]: With dead ends: 68 [2022-07-19 15:26:50,197 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 15:26:50,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-07-19 15:26:50,198 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 15:26:50,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 107 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 129 Invalid, 0 Unknown, 9 Unchecked, 0.3s Time] [2022-07-19 15:26:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 15:26:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 15:26:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-07-19 15:26:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 15:26:50,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2022-07-19 15:26:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:26:50,200 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 15:26:50,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 15:26:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 15:26:50,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 15:26:50,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 15:26:50,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-19 15:26:50,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 15:26:50,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 15:27:16,551 WARN L233 SmtUtils]: Spent 22.90s on a formula simplification. DAG size of input: 133 DAG size of output: 27 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-19 15:27:21,432 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 15:27:21,433 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-07-19 15:27:21,433 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (or (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|) |ULTIMATE.start_check_~n#1|)) (not (bvslt (bvadd |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~n#1|))) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))) (and (= (_ bv0 32) |ULTIMATE.start_lcp_~l~0#1|) (= |ULTIMATE.start_check_~l#1| (_ bv0 32)) (= |ULTIMATE.start_lcp_#res#1| (_ bv0 32)))) [2022-07-19 15:27:21,433 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-07-19 15:27:21,433 INFO L895 garLoopResultBuilder]: At program point L21(lines 16 22) the Hoare annotation is: (or (and (= (_ bv0 32) |ULTIMATE.start_lcp_~l~0#1|) (= |ULTIMATE.start_lcp_#res#1| (_ bv0 32))) (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|)))))) [2022-07-19 15:27:21,433 INFO L902 garLoopResultBuilder]: At program point L48(lines 35 49) the Hoare annotation is: true [2022-07-19 15:27:21,433 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-07-19 15:27:21,433 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2022-07-19 15:27:21,433 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: false [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|) |ULTIMATE.start_check_~n#1|)) (not (bvslt (bvadd |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~n#1|))) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_check_~i~0#1| (_ BitVec 32)) (|ULTIMATE.start_check_~x#1| (_ BitVec 32)) (|ULTIMATE.start_check_~a#1.offset| (_ BitVec 32)) (|ULTIMATE.start_check_~y#1| (_ BitVec 32))) (let ((.cse1 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))) (.cse2 (bvmul |ULTIMATE.start_check_~i~0#1| (_ bv4 32)))) (and (= (select .cse1 (bvadd |ULTIMATE.start_check_~a#1.offset| .cse2 (bvmul (_ bv4 32) |ULTIMATE.start_check_~x#1|))) |ULTIMATE.start_check_#t~mem10#1|) (= (select .cse1 (bvadd |ULTIMATE.start_check_~a#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_check_~y#1|) .cse2)) |ULTIMATE.start_check_#t~mem11#1|)))) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))) [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 33) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point L18-1(line 18) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L895 garLoopResultBuilder]: At program point L18-5(lines 18 20) the Hoare annotation is: (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~x#1|) (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)))) [2022-07-19 15:27:21,434 INFO L899 garLoopResultBuilder]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2022-07-19 15:27:21,434 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_#t~malloc15#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))) [2022-07-19 15:27:21,435 INFO L899 garLoopResultBuilder]: For program point L43-1(line 43) no Hoare annotation was computed. [2022-07-19 15:27:21,435 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-07-19 15:27:21,435 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-07-19 15:27:21,435 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-07-19 15:27:21,435 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-07-19 15:27:21,435 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 14) the Hoare annotation is: true [2022-07-19 15:27:21,435 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-07-19 15:27:21,435 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-07-19 15:27:21,435 INFO L899 garLoopResultBuilder]: For program point L13-3(lines 12 14) no Hoare annotation was computed. [2022-07-19 15:27:21,435 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 14) no Hoare annotation was computed. [2022-07-19 15:27:21,435 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-07-19 15:27:21,438 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1] [2022-07-19 15:27:21,440 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 15:27:21,445 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:449) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 15:27:21,447 INFO L158 Benchmark]: Toolchain (without parser) took 184547.91ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 33.7MB in the beginning and 64.8MB in the end (delta: -31.1MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2022-07-19 15:27:21,448 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 15:27:21,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.84ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.5MB in the beginning and 56.0MB in the end (delta: -22.4MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-07-19 15:27:21,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.62ms. Allocated memory is still 73.4MB. Free memory was 55.8MB in the beginning and 54.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:27:21,449 INFO L158 Benchmark]: Boogie Preprocessor took 23.63ms. Allocated memory is still 73.4MB. Free memory was 54.0MB in the beginning and 52.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 15:27:21,449 INFO L158 Benchmark]: RCFGBuilder took 314.48ms. Allocated memory is still 73.4MB. Free memory was 52.5MB in the beginning and 40.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 15:27:21,450 INFO L158 Benchmark]: TraceAbstraction took 183916.83ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 39.8MB in the beginning and 64.8MB in the end (delta: -25.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-07-19 15:27:21,453 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 56.6MB. Free memory was 38.2MB in the beginning and 38.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.84ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.5MB in the beginning and 56.0MB in the end (delta: -22.4MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.62ms. Allocated memory is still 73.4MB. Free memory was 55.8MB in the beginning and 54.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.63ms. Allocated memory is still 73.4MB. Free memory was 54.0MB in the beginning and 52.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 314.48ms. Allocated memory is still 73.4MB. Free memory was 52.5MB in the beginning and 40.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 183916.83ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 39.8MB in the beginning and 64.8MB in the end (delta: -25.0MB). Peak memory consumption was 35.9MB. 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 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 183.8s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 94.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 31.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 476 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 1528 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 608 IncrementalHoareTripleChecker+Unchecked, 1298 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1730 IncrementalHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 230 mSDtfsCounter, 1730 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 769 GetRequests, 516 SyntacticMatches, 10 SemanticMatches, 243 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 130.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=8, InterpolantAutomatonStates: 164, 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, 9 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 48 PreInvPairs, 87 NumberOfFragments, 314 HoareAnnotationTreeSize, 48 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 7148 FormulaSimplificationTreeSizeReductionInter, 30.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 53.4s InterpolantComputationTime, 466 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 607 ConstructedInterpolants, 71 QuantifiedInterpolants, 5879 SizeOfPredicates, 194 NumberOfNonLiveVariables, 1283 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 514/657 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:234) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 15:27:21,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias