./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/elimination_max.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 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 10:58:57,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 10:58:57,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 10:58:57,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 10:58:57,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 10:58:57,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 10:58:57,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 10:58:57,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 10:58:57,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 10:58:57,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 10:58:57,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 10:58:57,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 10:58:57,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 10:58:57,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 10:58:57,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 10:58:57,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 10:58:57,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 10:58:57,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 10:58:57,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 10:58:57,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 10:58:57,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 10:58:57,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 10:58:57,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 10:58:57,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 10:58:57,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 10:58:57,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 10:58:57,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 10:58:57,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 10:58:57,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 10:58:57,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 10:58:57,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 10:58:57,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 10:58:57,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 10:58:57,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 10:58:57,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 10:58:57,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 10:58:57,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 10:58:57,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 10:58:57,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 10:58:57,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 10:58:57,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 10:58:57,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 10:58:57,481 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 10:58:57,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 10:58:57,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 10:58:57,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 10:58:57,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 10:58:57,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 10:58:57,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 10:58:57,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 10:58:57,482 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 10:58:57,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 10:58:57,482 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 10:58:57,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 10:58:57,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 10:58:57,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 10:58:57,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 10:58:57,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:58:57,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 10:58:57,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 10:58:57,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 10:58:57,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 10:58:57,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 10:58:57,484 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 10:58:57,484 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 10:58:57,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 10:58:57,484 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 10:58:57,484 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 -> 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e [2021-12-17 10:58:57,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 10:58:57,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 10:58:57,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 10:58:57,729 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 10:58:57,729 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 10:58:57,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max.c [2021-12-17 10:58:57,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59827529/3a0e39163fb142b38583c98b87e434eb/FLAG5fd6a56ad [2021-12-17 10:58:58,080 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 10:58:58,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2021-12-17 10:58:58,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59827529/3a0e39163fb142b38583c98b87e434eb/FLAG5fd6a56ad [2021-12-17 10:58:58,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59827529/3a0e39163fb142b38583c98b87e434eb [2021-12-17 10:58:58,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 10:58:58,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 10:58:58,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 10:58:58,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 10:58:58,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 10:58:58,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b073d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58, skipping insertion in model container [2021-12-17 10:58:58,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 10:58:58,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 10:58:58,645 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/elimination_max.c[485,498] [2021-12-17 10:58:58,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:58:58,667 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 10:58:58,678 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/elimination_max.c[485,498] [2021-12-17 10:58:58,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:58:58,703 INFO L208 MainTranslator]: Completed translation [2021-12-17 10:58:58,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58 WrapperNode [2021-12-17 10:58:58,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 10:58:58,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 10:58:58,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 10:58:58,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 10:58:58,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,736 INFO L137 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2021-12-17 10:58:58,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 10:58:58,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 10:58:58,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 10:58:58,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 10:58:58,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 10:58:58,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 10:58:58,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 10:58:58,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 10:58:58,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (1/1) ... [2021-12-17 10:58:58,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:58:58,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:58:58,811 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) [2021-12-17 10:58:58,813 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 [2021-12-17 10:58:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 10:58:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-17 10:58:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-17 10:58:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 10:58:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 10:58:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 10:58:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 10:58:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 10:58:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 10:58:58,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 10:58:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 10:58:58,909 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 10:58:58,910 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 10:58:59,040 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 10:58:59,044 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 10:58:59,044 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 10:58:59,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:58:59 BoogieIcfgContainer [2021-12-17 10:58:59,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 10:58:59,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 10:58:59,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 10:58:59,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 10:58:59,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:58:58" (1/3) ... [2021-12-17 10:58:59,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aff8f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:58:59, skipping insertion in model container [2021-12-17 10:58:59,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:58" (2/3) ... [2021-12-17 10:58:59,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aff8f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:58:59, skipping insertion in model container [2021-12-17 10:58:59,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:58:59" (3/3) ... [2021-12-17 10:58:59,052 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2021-12-17 10:58:59,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 10:58:59,056 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 10:58:59,083 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 10:58:59,087 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 10:58:59,087 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 10:58:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 10:58:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 10:58:59,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:58:59,100 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:58:59,101 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:58:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:58:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash 434333419, now seen corresponding path program 1 times [2021-12-17 10:58:59,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:58:59,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013688637] [2021-12-17 10:58:59,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:58:59,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:58:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 10:58:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 10:58:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 10:58:59,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:58:59,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013688637] [2021-12-17 10:58:59,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013688637] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:58:59,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:58:59,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 10:58:59,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163633025] [2021-12-17 10:58:59,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:58:59,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 10:58:59,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:58:59,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 10:58:59,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 10:58:59,268 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:58:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:58:59,284 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2021-12-17 10:58:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 10:58:59,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-12-17 10:58:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:58:59,291 INFO L225 Difference]: With dead ends: 57 [2021-12-17 10:58:59,291 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 10:58:59,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 10:58:59,298 INFO L933 BasicCegarLoop]: 34 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, 34 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 [2021-12-17 10:58:59,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:58:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 10:58:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-17 10:58:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 10:58:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-17 10:58:59,334 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2021-12-17 10:58:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:58:59,334 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-17 10:58:59,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:58:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-17 10:58:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 10:58:59,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:58:59,336 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:58:59,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 10:58:59,337 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:58:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:58:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1040778997, now seen corresponding path program 1 times [2021-12-17 10:58:59,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:58:59,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957638282] [2021-12-17 10:58:59,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:58:59,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:58:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 10:58:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 10:58:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 10:58:59,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:58:59,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957638282] [2021-12-17 10:58:59,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957638282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:58:59,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:58:59,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 10:58:59,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510821240] [2021-12-17 10:58:59,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:58:59,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 10:58:59,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:58:59,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 10:58:59,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 10:58:59,566 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:58:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:58:59,659 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2021-12-17 10:58:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 10:58:59,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-12-17 10:58:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:58:59,661 INFO L225 Difference]: With dead ends: 32 [2021-12-17 10:58:59,661 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 10:58:59,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-17 10:58:59,665 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:58:59,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 103 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:58:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 10:58:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 10:58:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 10:58:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-12-17 10:58:59,674 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2021-12-17 10:58:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:58:59,675 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-12-17 10:58:59,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:58:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-12-17 10:58:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 10:58:59,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:58:59,676 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:58:59,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 10:58:59,676 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:58:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:58:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1270583733, now seen corresponding path program 1 times [2021-12-17 10:58:59,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:58:59,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035448036] [2021-12-17 10:58:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:58:59,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:58:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 10:58:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 10:58:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 10:58:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:58:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 10:58:59,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:58:59,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035448036] [2021-12-17 10:58:59,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035448036] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:58:59,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:58:59,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 10:58:59,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145586452] [2021-12-17 10:58:59,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:58:59,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 10:58:59,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:58:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 10:58:59,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 10:58:59,824 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 10:58:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:58:59,899 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2021-12-17 10:58:59,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 10:58:59,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2021-12-17 10:58:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:58:59,901 INFO L225 Difference]: With dead ends: 30 [2021-12-17 10:58:59,901 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 10:58:59,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-17 10:58:59,904 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:58:59,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 117 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:58:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 10:58:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 10:58:59,906 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) [2021-12-17 10:58:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 10:58:59,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2021-12-17 10:58:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:58:59,906 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 10:58:59,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 10:58:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 10:58:59,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 10:58:59,909 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 10:58:59,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 10:58:59,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 10:58:59,945 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 25 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| |ULTIMATE.start_main_#t~malloc6#1.base|) .cse0) (= (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse0))) [2021-12-17 10:58:59,945 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 10:58:59,945 INFO L858 garLoopResultBuilder]: For program point L25-2(lines 25 37) no Hoare annotation was computed. [2021-12-17 10:58:59,945 INFO L861 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: true [2021-12-17 10:58:59,945 INFO L858 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2021-12-17 10:58:59,946 INFO L861 garLoopResultBuilder]: At program point L50(lines 16 51) the Hoare annotation is: true [2021-12-17 10:58:59,946 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| |ULTIMATE.start_main_#t~malloc6#1.base|) .cse0) (<= 0 |ULTIMATE.start_main_#t~mem16#1|) (= |ULTIMATE.start_main_#t~mem15#1| 0) (= (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse0))) [2021-12-17 10:58:59,946 INFO L858 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2021-12-17 10:58:59,946 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| |ULTIMATE.start_main_#t~malloc6#1.base|) .cse0) (= (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse0))) [2021-12-17 10:58:59,946 INFO L858 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2021-12-17 10:58:59,946 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 10:58:59,946 INFO L858 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-12-17 10:58:59,947 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 10:58:59,947 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 10:58:59,947 INFO L854 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse1 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= |ULTIMATE.start_main_#t~mem12#1| 0) (= (select |#memory_int| |ULTIMATE.start_main_#t~malloc6#1.base|) .cse0) (= .cse1 .cse0) (= (select .cse1 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~x~0#1| 4))) |ULTIMATE.start_main_#t~mem13#1|))) [2021-12-17 10:58:59,947 INFO L858 garLoopResultBuilder]: For program point L45-2(lines 45 47) no Hoare annotation was computed. [2021-12-17 10:58:59,947 INFO L858 garLoopResultBuilder]: For program point L43-1(line 43) no Hoare annotation was computed. [2021-12-17 10:58:59,947 INFO L854 garLoopResultBuilder]: At program point L45-3(lines 45 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| |ULTIMATE.start_main_#t~malloc6#1.base|) .cse0) (= (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse0))) [2021-12-17 10:58:59,947 INFO L858 garLoopResultBuilder]: For program point L45-4(lines 45 47) no Hoare annotation was computed. [2021-12-17 10:58:59,948 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 36) no Hoare annotation was computed. [2021-12-17 10:58:59,948 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2021-12-17 10:58:59,948 INFO L858 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2021-12-17 10:58:59,948 INFO L858 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2021-12-17 10:58:59,948 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2021-12-17 10:58:59,948 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2021-12-17 10:58:59,948 INFO L858 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2021-12-17 10:58:59,950 INFO L858 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2021-12-17 10:58:59,950 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 12) no Hoare annotation was computed. [2021-12-17 10:58:59,950 INFO L858 garLoopResultBuilder]: For program point L11-3(lines 10 12) no Hoare annotation was computed. [2021-12-17 10:58:59,950 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-12-17 10:58:59,956 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-12-17 10:58:59,957 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 10:58:59,962 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:240) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) 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:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2021-12-17 10:58:59,964 INFO L158 Benchmark]: Toolchain (without parser) took 1442.97ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.1MB in the beginning and 66.0MB in the end (delta: -1.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2021-12-17 10:58:59,964 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 10:58:59,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.34ms. Allocated memory is still 100.7MB. Free memory was 63.9MB in the beginning and 75.4MB in the end (delta: -11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 10:58:59,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 73.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 10:58:59,964 INFO L158 Benchmark]: Boogie Preprocessor took 33.18ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 72.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 10:58:59,965 INFO L158 Benchmark]: RCFGBuilder took 274.11ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 62.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 10:58:59,965 INFO L158 Benchmark]: TraceAbstraction took 916.89ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 61.5MB in the beginning and 66.0MB in the end (delta: -4.5MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2021-12-17 10:58:59,966 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.21ms. Allocated memory is still 100.7MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.34ms. Allocated memory is still 100.7MB. Free memory was 63.9MB in the beginning and 75.4MB in the end (delta: -11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 73.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.18ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 72.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 274.11ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 62.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 916.89ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 61.5MB in the beginning and 66.0MB in the end (delta: -4.5MB). Peak memory consumption was 17.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: 11]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 81 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 89 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 14/14 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:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-17 10:58:59,990 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/elimination_max.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 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 10:59:01,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 10:59:01,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 10:59:01,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 10:59:01,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 10:59:01,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 10:59:01,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 10:59:01,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 10:59:01,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 10:59:01,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 10:59:01,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 10:59:01,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 10:59:01,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 10:59:01,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 10:59:01,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 10:59:01,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 10:59:01,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 10:59:01,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 10:59:01,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 10:59:01,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 10:59:01,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 10:59:01,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 10:59:01,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 10:59:01,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 10:59:01,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 10:59:01,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 10:59:01,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 10:59:01,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 10:59:01,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 10:59:01,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 10:59:01,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 10:59:01,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 10:59:01,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 10:59:01,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 10:59:01,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 10:59:01,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 10:59:01,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 10:59:01,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 10:59:01,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 10:59:01,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 10:59:01,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 10:59:01,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 10:59:01,774 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 10:59:01,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 10:59:01,775 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 10:59:01,776 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 10:59:01,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 10:59:01,776 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 10:59:01,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 10:59:01,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 10:59:01,778 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 10:59:01,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 10:59:01,778 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 10:59:01,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 10:59:01,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 10:59:01,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 10:59:01,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 10:59:01,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 10:59:01,779 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 10:59:01,779 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 10:59:01,780 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 10:59:01,780 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 10:59:01,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 10:59:01,780 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 10:59:01,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 10:59:01,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 10:59:01,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 10:59:01,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 10:59:01,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:59:01,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 10:59:01,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 10:59:01,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 10:59:01,781 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 10:59:01,781 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 10:59:01,782 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 10:59:01,782 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 10:59:01,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 10:59:01,782 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 10:59:01,782 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 10:59:01,782 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 -> 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e [2021-12-17 10:59:02,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 10:59:02,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 10:59:02,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 10:59:02,050 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 10:59:02,050 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 10:59:02,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max.c [2021-12-17 10:59:02,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b40ae433/5072d013b6fe4bed9171385f4d290c5f/FLAG8e48cf06e [2021-12-17 10:59:02,478 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 10:59:02,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2021-12-17 10:59:02,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b40ae433/5072d013b6fe4bed9171385f4d290c5f/FLAG8e48cf06e [2021-12-17 10:59:02,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b40ae433/5072d013b6fe4bed9171385f4d290c5f [2021-12-17 10:59:02,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 10:59:02,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 10:59:02,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 10:59:02,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 10:59:02,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 10:59:02,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:59:02" (1/1) ... [2021-12-17 10:59:02,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f83fb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:02, skipping insertion in model container [2021-12-17 10:59:02,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:59:02" (1/1) ... [2021-12-17 10:59:02,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 10:59:02,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 10:59:03,054 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/elimination_max.c[485,498] [2021-12-17 10:59:03,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:59:03,084 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 10:59:03,095 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/elimination_max.c[485,498] [2021-12-17 10:59:03,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:59:03,126 INFO L208 MainTranslator]: Completed translation [2021-12-17 10:59:03,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03 WrapperNode [2021-12-17 10:59:03,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 10:59:03,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 10:59:03,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 10:59:03,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 10:59:03,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,193 INFO L137 Inliner]: procedures = 20, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2021-12-17 10:59:03,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 10:59:03,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 10:59:03,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 10:59:03,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 10:59:03,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 10:59:03,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 10:59:03,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 10:59:03,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 10:59:03,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (1/1) ... [2021-12-17 10:59:03,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:59:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:59:03,268 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) [2021-12-17 10:59:03,277 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 [2021-12-17 10:59:03,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 10:59:03,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 10:59:03,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-17 10:59:03,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-17 10:59:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 10:59:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 10:59:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 10:59:03,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 10:59:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 10:59:03,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 10:59:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 10:59:03,372 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 10:59:03,374 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 10:59:03,531 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 10:59:03,535 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 10:59:03,540 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 10:59:03,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:59:03 BoogieIcfgContainer [2021-12-17 10:59:03,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 10:59:03,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 10:59:03,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 10:59:03,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 10:59:03,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:59:02" (1/3) ... [2021-12-17 10:59:03,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2c13c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:59:03, skipping insertion in model container [2021-12-17 10:59:03,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:59:03" (2/3) ... [2021-12-17 10:59:03,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2c13c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:59:03, skipping insertion in model container [2021-12-17 10:59:03,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:59:03" (3/3) ... [2021-12-17 10:59:03,551 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2021-12-17 10:59:03,555 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 10:59:03,556 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 10:59:03,599 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 10:59:03,612 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 10:59:03,613 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 10:59:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 10:59:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 10:59:03,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:59:03,630 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:59:03,645 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:59:03,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:59:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash 434333419, now seen corresponding path program 1 times [2021-12-17 10:59:03,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 10:59:03,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596445773] [2021-12-17 10:59:03,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:59:03,660 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 10:59:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 10:59:03,662 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) [2021-12-17 10:59:03,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 10:59:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:59:03,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 10:59:03,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:59:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 10:59:03,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 10:59:03,804 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 10:59:03,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596445773] [2021-12-17 10:59:03,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596445773] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:59:03,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:59:03,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 10:59:03,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622388907] [2021-12-17 10:59:03,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:59:03,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 10:59:03,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 10:59:03,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 10:59:03,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 10:59:03,827 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:59:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:59:03,839 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2021-12-17 10:59:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 10:59:03,840 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-12-17 10:59:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:59:03,845 INFO L225 Difference]: With dead ends: 57 [2021-12-17 10:59:03,845 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 10:59:03,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 10:59:03,849 INFO L933 BasicCegarLoop]: 34 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, 34 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 [2021-12-17 10:59:03,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:59:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 10:59:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-17 10:59:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 10:59:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-17 10:59:03,873 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2021-12-17 10:59:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:59:03,874 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-17 10:59:03,874 INFO L471 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:59:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-17 10:59:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 10:59:03,875 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:59:03,875 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:59:03,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 10:59:04,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 10:59:04,084 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:59:04,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:59:04,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1040778997, now seen corresponding path program 1 times [2021-12-17 10:59:04,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 10:59:04,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100089320] [2021-12-17 10:59:04,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:59:04,085 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 10:59:04,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 10:59:04,086 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) [2021-12-17 10:59:04,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 10:59:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:59:04,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 10:59:04,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:59:04,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 10:59:04,467 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 10:59:04,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-17 10:59:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 10:59:04,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 10:59:04,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 10:59:04,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100089320] [2021-12-17 10:59:04,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100089320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:59:04,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:59:04,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 10:59:04,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536731852] [2021-12-17 10:59:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:59:04,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 10:59:04,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 10:59:04,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 10:59:04,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-17 10:59:04,557 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:59:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:59:04,846 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2021-12-17 10:59:04,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 10:59:04,847 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-12-17 10:59:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:59:04,848 INFO L225 Difference]: With dead ends: 39 [2021-12-17 10:59:04,848 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 10:59:04,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-12-17 10:59:04,850 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 10:59:04,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 159 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2021-12-17 10:59:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 10:59:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-12-17 10:59:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 10:59:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-12-17 10:59:04,859 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 21 [2021-12-17 10:59:04,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:59:04,860 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-12-17 10:59:04,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:59:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-12-17 10:59:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 10:59:04,862 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:59:04,862 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:59:04,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 10:59:05,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 10:59:05,071 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:59:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:59:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash 953578392, now seen corresponding path program 1 times [2021-12-17 10:59:05,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 10:59:05,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057460398] [2021-12-17 10:59:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:59:05,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 10:59:05,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 10:59:05,073 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) [2021-12-17 10:59:05,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 10:59:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:59:05,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-17 10:59:05,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:59:05,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 10:59:05,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 10:59:05,821 INFO L354 Elim1Store]: treesize reduction 10, result has 73.7 percent of original size [2021-12-17 10:59:05,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 37 [2021-12-17 10:59:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:59:06,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:59:06,269 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 10:59:06,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057460398] [2021-12-17 10:59:06,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057460398] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:59:06,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2008386982] [2021-12-17 10:59:06,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:59:06,269 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 10:59:06,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 10:59:06,271 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) [2021-12-17 10:59:06,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2021-12-17 10:59:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:59:06,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 10:59:06,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:59:06,452 INFO L388 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 [2021-12-17 10:59:09,993 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2021-12-17 10:59:10,119 INFO L388 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 29 treesize of output 23 [2021-12-17 10:59:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 10:59:10,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 10:59:10,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2008386982] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:59:10,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 10:59:10,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 21 [2021-12-17 10:59:10,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642399559] [2021-12-17 10:59:10,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:59:10,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 10:59:10,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 10:59:10,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 10:59:10,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=487, Unknown=1, NotChecked=44, Total=600 [2021-12-17 10:59:10,184 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:59:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:59:10,273 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2021-12-17 10:59:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 10:59:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2021-12-17 10:59:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:59:10,275 INFO L225 Difference]: With dead ends: 45 [2021-12-17 10:59:10,275 INFO L226 Difference]: Without dead ends: 43 [2021-12-17 10:59:10,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=89, Invalid=616, Unknown=1, NotChecked=50, Total=756 [2021-12-17 10:59:10,277 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:59:10,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 53 Unchecked, 0.0s Time] [2021-12-17 10:59:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-17 10:59:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2021-12-17 10:59:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 10:59:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2021-12-17 10:59:10,283 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2021-12-17 10:59:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:59:10,283 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2021-12-17 10:59:10,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 10:59:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2021-12-17 10:59:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 10:59:10,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:59:10,285 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:59:10,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2021-12-17 10:59:10,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 10:59:10,687 WARN L452 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 [2021-12-17 10:59:10,687 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:59:10,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:59:10,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1270583733, now seen corresponding path program 1 times [2021-12-17 10:59:10,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 10:59:10,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296062693] [2021-12-17 10:59:10,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:59:10,688 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 10:59:10,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 10:59:10,689 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) [2021-12-17 10:59:10,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 10:59:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:59:10,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 10:59:10,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:59:10,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 10:59:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 10:59:10,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 10:59:10,816 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 10:59:10,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296062693] [2021-12-17 10:59:10,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296062693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:59:10,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:59:10,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 10:59:10,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735725963] [2021-12-17 10:59:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:59:10,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 10:59:10,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 10:59:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 10:59:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 10:59:10,818 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 10:59:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:59:10,933 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2021-12-17 10:59:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 10:59:10,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-12-17 10:59:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:59:10,935 INFO L225 Difference]: With dead ends: 55 [2021-12-17 10:59:10,935 INFO L226 Difference]: Without dead ends: 53 [2021-12-17 10:59:10,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 10:59:10,936 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 10:59:10,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 147 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 10:59:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-17 10:59:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2021-12-17 10:59:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-17 10:59:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2021-12-17 10:59:10,942 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 28 [2021-12-17 10:59:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:59:10,943 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2021-12-17 10:59:10,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 10:59:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2021-12-17 10:59:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-17 10:59:10,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:59:10,944 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-17 10:59:10,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 10:59:11,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 10:59:11,152 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:59:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:59:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1943727032, now seen corresponding path program 1 times [2021-12-17 10:59:11,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 10:59:11,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14891977] [2021-12-17 10:59:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:59:11,153 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 10:59:11,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 10:59:11,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 10:59:11,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 10:59:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:59:11,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 10:59:11,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:59:12,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 10:59:12,007 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 10:59:12,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 13 [2021-12-17 10:59:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:59:12,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:59:12,657 INFO L354 Elim1Store]: treesize reduction 73, result has 17.0 percent of original size [2021-12-17 10:59:12,658 INFO L388 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 37 treesize of output 22 [2021-12-17 10:59:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 10:59:12,780 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 10:59:12,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14891977] [2021-12-17 10:59:12,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14891977] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:59:12,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 10:59:12,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2021-12-17 10:59:12,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445173861] [2021-12-17 10:59:12,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 10:59:12,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-17 10:59:12,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 10:59:12,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-17 10:59:12,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-12-17 10:59:12,782 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 10:59:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:59:14,465 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2021-12-17 10:59:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-17 10:59:14,466 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2021-12-17 10:59:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:59:14,467 INFO L225 Difference]: With dead ends: 93 [2021-12-17 10:59:14,467 INFO L226 Difference]: Without dead ends: 91 [2021-12-17 10:59:14,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2021-12-17 10:59:14,468 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 99 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 10:59:14,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 410 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 333 Invalid, 0 Unknown, 61 Unchecked, 0.6s Time] [2021-12-17 10:59:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-17 10:59:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2021-12-17 10:59:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 47 states have internal predecessors, (53), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 10:59:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2021-12-17 10:59:14,477 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 30 [2021-12-17 10:59:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:59:14,477 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2021-12-17 10:59:14,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 10:59:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2021-12-17 10:59:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 10:59:14,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:59:14,479 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-12-17 10:59:14,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 10:59:14,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 10:59:14,685 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:59:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:59:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1112024125, now seen corresponding path program 1 times [2021-12-17 10:59:14,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 10:59:14,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686867186] [2021-12-17 10:59:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:59:14,686 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 10:59:14,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 10:59:14,687 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) [2021-12-17 10:59:14,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 10:59:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:59:14,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 10:59:14,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:59:42,224 INFO L354 Elim1Store]: treesize reduction 32, result has 86.5 percent of original size [2021-12-17 10:59:42,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 225 [2021-12-17 10:59:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:59:44,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:59:52,930 INFO L354 Elim1Store]: treesize reduction 43, result has 49.4 percent of original size [2021-12-17 10:59:52,931 INFO L388 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 55 treesize of output 52 [2021-12-17 10:59:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 10:59:57,083 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 10:59:57,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686867186] [2021-12-17 10:59:57,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686867186] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:59:57,083 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 10:59:57,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-12-17 10:59:57,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070098960] [2021-12-17 10:59:57,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 10:59:57,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 10:59:57,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 10:59:57,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 10:59:57,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=422, Unknown=17, NotChecked=0, Total=506 [2021-12-17 10:59:57,084 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 11:00:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:00:24,325 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2021-12-17 11:00:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 11:00:24,326 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2021-12-17 11:00:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:00:24,328 INFO L225 Difference]: With dead ends: 125 [2021-12-17 11:00:24,329 INFO L226 Difference]: Without dead ends: 123 [2021-12-17 11:00:24,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 66.2s TimeCoverageRelationStatistics Valid=117, Invalid=785, Unknown=28, NotChecked=0, Total=930 [2021-12-17 11:00:24,331 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 11:00:24,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 542 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 187 Invalid, 0 Unknown, 194 Unchecked, 0.5s Time] [2021-12-17 11:00:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-17 11:00:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 66. [2021-12-17 11:00:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 11:00:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2021-12-17 11:00:24,346 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2021-12-17 11:00:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:00:24,347 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2021-12-17 11:00:24,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 11:00:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2021-12-17 11:00:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 11:00:24,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:00:24,348 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:00:24,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 11:00:24,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 11:00:24,548 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:00:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:00:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash -110653822, now seen corresponding path program 2 times [2021-12-17 11:00:24,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 11:00:24,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427512281] [2021-12-17 11:00:24,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 11:00:24,550 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 11:00:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 11:00:24,550 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) [2021-12-17 11:00:24,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 11:00:24,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 11:00:24,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:00:24,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 11:00:24,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:00:25,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 11:00:25,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 11:00:25,673 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 11:00:25,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 13 [2021-12-17 11:00:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 11:00:25,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:00:27,142 INFO L354 Elim1Store]: treesize reduction 73, result has 17.0 percent of original size [2021-12-17 11:00:27,142 INFO L388 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 37 treesize of output 22 [2021-12-17 11:00:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 11:00:27,321 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 11:00:27,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427512281] [2021-12-17 11:00:27,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427512281] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:00:27,322 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:00:27,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 30 [2021-12-17 11:00:27,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524692223] [2021-12-17 11:00:27,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:00:27,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-17 11:00:27,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 11:00:27,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-17 11:00:27,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2021-12-17 11:00:27,323 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 11:00:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:00:33,945 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2021-12-17 11:00:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-17 11:00:33,946 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2021-12-17 11:00:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:00:33,947 INFO L225 Difference]: With dead ends: 164 [2021-12-17 11:00:33,947 INFO L226 Difference]: Without dead ends: 162 [2021-12-17 11:00:33,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=568, Invalid=3592, Unknown=0, NotChecked=0, Total=4160 [2021-12-17 11:00:33,949 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 177 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-17 11:00:33,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 590 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 694 Invalid, 0 Unknown, 98 Unchecked, 1.8s Time] [2021-12-17 11:00:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-17 11:00:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 78. [2021-12-17 11:00:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 63 states have internal predecessors, (85), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 11:00:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2021-12-17 11:00:33,973 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 34 [2021-12-17 11:00:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:00:33,974 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2021-12-17 11:00:33,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 11:00:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2021-12-17 11:00:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 11:00:33,979 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:00:33,979 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:00:33,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-17 11:00:34,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 11:00:34,189 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:00:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:00:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash 108200896, now seen corresponding path program 2 times [2021-12-17 11:00:34,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 11:00:34,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139624084] [2021-12-17 11:00:34,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 11:00:34,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 11:00:34,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 11:00:34,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 11:00:34,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 11:00:34,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 11:00:34,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:00:34,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-17 11:00:34,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:00:35,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 11:00:35,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 11:00:35,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 11:00:35,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 11:00:35,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 11:00:35,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 11:00:35,829 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 11:00:35,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 20 [2021-12-17 11:00:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 11:00:35,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:00:44,859 INFO L354 Elim1Store]: treesize reduction 209, result has 11.4 percent of original size [2021-12-17 11:00:44,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 41 [2021-12-17 11:00:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 11:00:45,122 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 11:00:45,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139624084] [2021-12-17 11:00:45,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139624084] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:00:45,122 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:00:45,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2021-12-17 11:00:45,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962046729] [2021-12-17 11:00:45,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:00:45,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-17 11:00:45,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 11:00:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-17 11:00:45,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=802, Unknown=3, NotChecked=0, Total=930 [2021-12-17 11:00:45,124 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand has 31 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 11:00:49,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:01:15,855 WARN L227 SmtUtils]: Spent 24.36s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:01:19,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:02:00,546 WARN L227 SmtUtils]: Spent 38.33s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:02:02,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:02:04,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:02:06,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:02:22,945 WARN L227 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:02:25,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:02:27,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:02:30,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:03:13,521 WARN L227 SmtUtils]: Spent 38.30s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:03:15,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:03:54,203 WARN L227 SmtUtils]: Spent 38.36s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:03:56,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:03:58,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:00,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:16,715 WARN L227 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:04:18,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:20,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:22,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:24,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:26,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:28,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:30,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:32,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:53,291 WARN L227 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:04:55,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:57,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:04:59,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:13,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:15,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:17,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:19,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:21,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:23,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:25,813 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:27,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:29,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:31,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:33,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:05:37,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:10,001 WARN L227 SmtUtils]: Spent 14.18s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:06:12,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:14,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:36,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:38,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:40,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:42,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:44,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:47,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:49,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:51,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:53,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:06:55,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:07:25,912 WARN L227 SmtUtils]: Spent 14.19s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:07:27,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:07:29,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:07:31,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:08:36,975 WARN L227 SmtUtils]: Spent 38.46s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:08:39,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:08:41,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:09:13,785 WARN L227 SmtUtils]: Spent 14.24s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:09:15,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:09:17,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:09:19,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:10:28,919 WARN L227 SmtUtils]: Spent 38.39s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:10:32,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:10:36,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:10:38,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:10:54,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 11:10:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:10:56,539 INFO L93 Difference]: Finished difference Result 214 states and 285 transitions. [2021-12-17 11:10:56,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-12-17 11:10:56,541 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2021-12-17 11:10:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:10:56,542 INFO L225 Difference]: With dead ends: 214 [2021-12-17 11:10:56,542 INFO L226 Difference]: Without dead ends: 212 [2021-12-17 11:10:56,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 497.4s TimeCoverageRelationStatistics Valid=1175, Invalid=5870, Unknown=95, NotChecked=0, Total=7140 [2021-12-17 11:10:56,544 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 313 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 261 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 123.2s IncrementalHoareTripleChecker+Time [2021-12-17 11:10:56,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 745 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 935 Invalid, 59 Unknown, 212 Unchecked, 123.2s Time] [2021-12-17 11:10:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-17 11:10:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 94. [2021-12-17 11:10:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 79 states have internal predecessors, (117), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 11:10:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2021-12-17 11:10:56,564 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 34 [2021-12-17 11:10:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:10:56,564 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2021-12-17 11:10:56,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 11:10:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2021-12-17 11:10:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 11:10:56,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:10:56,565 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:10:56,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-17 11:10:56,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 11:10:56,768 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:10:56,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:10:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash 483067350, now seen corresponding path program 1 times [2021-12-17 11:10:56,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 11:10:56,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657142775] [2021-12-17 11:10:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:10:56,769 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 11:10:56,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 11:10:56,770 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) [2021-12-17 11:10:56,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-17 11:10:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:10:56,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 11:10:56,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:10:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 11:10:57,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:10:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 11:10:57,305 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 11:10:57,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657142775] [2021-12-17 11:10:57,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657142775] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:10:57,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:10:57,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2021-12-17 11:10:57,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657276779] [2021-12-17 11:10:57,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:10:57,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 11:10:57,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 11:10:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 11:10:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-12-17 11:10:57,307 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-17 11:10:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:10:57,673 INFO L93 Difference]: Finished difference Result 114 states and 158 transitions. [2021-12-17 11:10:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 11:10:57,673 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 36 [2021-12-17 11:10:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:10:57,674 INFO L225 Difference]: With dead ends: 114 [2021-12-17 11:10:57,674 INFO L226 Difference]: Without dead ends: 94 [2021-12-17 11:10:57,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-12-17 11:10:57,675 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 11:10:57,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 153 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 11:10:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-17 11:10:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-17 11:10:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 79 states have internal predecessors, (116), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 11:10:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2021-12-17 11:10:57,685 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 36 [2021-12-17 11:10:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:10:57,685 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2021-12-17 11:10:57,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-17 11:10:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2021-12-17 11:10:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 11:10:57,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:10:57,686 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:10:57,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-17 11:10:57,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 11:10:57,893 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:10:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:10:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash -246405957, now seen corresponding path program 3 times [2021-12-17 11:10:57,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 11:10:57,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711500412] [2021-12-17 11:10:57,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 11:10:57,893 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 11:10:57,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 11:10:57,898 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) [2021-12-17 11:10:57,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-17 11:10:57,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 11:10:57,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:10:57,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 11:10:57,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:10:57,948 INFO L388 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 [2021-12-17 11:10:59,997 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (= (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_19|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2021-12-17 11:11:02,032 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (= (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_20|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2021-12-17 11:11:02,061 INFO L388 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 29 treesize of output 23 [2021-12-17 11:11:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2021-12-17 11:11:02,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:11:06,224 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 11:11:06,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711500412] [2021-12-17 11:11:06,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711500412] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 11:11:06,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [714933591] [2021-12-17 11:11:06,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 11:11:06,224 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 11:11:06,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 11:11:06,225 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 11:11:06,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-12-17 11:11:06,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 11:11:06,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:11:06,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 11:11:06,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:11:06,298 INFO L388 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 [2021-12-17 11:11:08,340 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_21| (_ BitVec 32))) (= (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_21|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2021-12-17 11:11:10,383 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (= (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_22|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2021-12-17 11:11:10,413 INFO L388 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 29 treesize of output 23 [2021-12-17 11:11:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2021-12-17 11:11:10,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:11:10,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [714933591] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 11:11:10,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:11:10,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-12-17 11:11:10,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587579757] [2021-12-17 11:11:10,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:11:10,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 11:11:10,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 11:11:10,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 11:11:10,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=89, Unknown=6, NotChecked=84, Total=210 [2021-12-17 11:11:10,474 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 11:11:14,530 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (= (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_19|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_21| (_ BitVec 32))) (= (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_21|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))))) is different from true [2021-12-17 11:11:16,552 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (= (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_22|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (= (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_20|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))))) is different from true [2021-12-17 11:11:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:11:16,600 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2021-12-17 11:11:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 11:11:16,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2021-12-17 11:11:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:11:16,601 INFO L225 Difference]: With dead ends: 102 [2021-12-17 11:11:16,601 INFO L226 Difference]: Without dead ends: 100 [2021-12-17 11:11:16,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=52, Invalid=145, Unknown=9, NotChecked=174, Total=380 [2021-12-17 11:11:16,602 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:11:16,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 110 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 166 Unchecked, 0.1s Time] [2021-12-17 11:11:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-17 11:11:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 41. [2021-12-17 11:11:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 11:11:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2021-12-17 11:11:16,608 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 36 [2021-12-17 11:11:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:11:16,609 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2021-12-17 11:11:16,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 11:11:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2021-12-17 11:11:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 11:11:16,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:11:16,609 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:11:16,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2021-12-17 11:11:16,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-17 11:11:17,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 11:11:17,011 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:11:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:11:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1210556717, now seen corresponding path program 1 times [2021-12-17 11:11:17,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 11:11:17,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059400901] [2021-12-17 11:11:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:11:17,012 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 11:11:17,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 11:11:17,013 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 11:11:17,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 11:11:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:11:17,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 11:11:17,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:11:17,155 INFO L388 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 19 treesize of output 7 [2021-12-17 11:11:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 11:11:17,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:11:17,248 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-17 11:11:17,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2021-12-17 11:11:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 11:11:17,381 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 11:11:17,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059400901] [2021-12-17 11:11:17,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059400901] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:11:17,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:11:17,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-12-17 11:11:17,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554439616] [2021-12-17 11:11:17,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:11:17,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 11:11:17,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 11:11:17,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 11:11:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-12-17 11:11:17,383 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-17 11:11:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:11:18,092 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2021-12-17 11:11:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 11:11:18,093 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 38 [2021-12-17 11:11:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:11:18,094 INFO L225 Difference]: With dead ends: 85 [2021-12-17 11:11:18,094 INFO L226 Difference]: Without dead ends: 83 [2021-12-17 11:11:18,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-12-17 11:11:18,095 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 11:11:18,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 392 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 11:11:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-17 11:11:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2021-12-17 11:11:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-17 11:11:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2021-12-17 11:11:18,107 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 38 [2021-12-17 11:11:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:11:18,107 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2021-12-17 11:11:18,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-17 11:11:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2021-12-17 11:11:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 11:11:18,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:11:18,108 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:11:18,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-17 11:11:18,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 11:11:18,315 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:11:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:11:18,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1720029807, now seen corresponding path program 1 times [2021-12-17 11:11:18,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 11:11:18,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32728919] [2021-12-17 11:11:18,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:11:18,316 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 11:11:18,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 11:11:18,317 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 11:11:18,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-17 11:11:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:11:18,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-17 11:11:18,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:11:19,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 11:11:19,457 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 11:11:19,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 14 [2021-12-17 11:11:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 11:11:19,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:11:20,273 INFO L354 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2021-12-17 11:11:20,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 17 [2021-12-17 11:11:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 11:11:20,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 11:11:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32728919] [2021-12-17 11:11:20,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32728919] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:11:20,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:11:20,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2021-12-17 11:11:20,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708997614] [2021-12-17 11:11:20,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:11:20,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-17 11:11:20,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 11:11:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-17 11:11:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2021-12-17 11:11:20,419 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 11:11:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:11:23,484 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2021-12-17 11:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-17 11:11:23,486 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 38 [2021-12-17 11:11:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:11:23,487 INFO L225 Difference]: With dead ends: 103 [2021-12-17 11:11:23,487 INFO L226 Difference]: Without dead ends: 101 [2021-12-17 11:11:23,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2021-12-17 11:11:23,488 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 97 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:11:23,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 491 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 415 Invalid, 0 Unknown, 147 Unchecked, 1.1s Time] [2021-12-17 11:11:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-17 11:11:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2021-12-17 11:11:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-17 11:11:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2021-12-17 11:11:23,500 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 38 [2021-12-17 11:11:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:11:23,501 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2021-12-17 11:11:23,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 11:11:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2021-12-17 11:11:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 11:11:23,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:11:23,502 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:11:23,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-17 11:11:23,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 11:11:23,708 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:11:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:11:23,709 INFO L85 PathProgramCache]: Analyzing trace with hash -990679920, now seen corresponding path program 2 times [2021-12-17 11:11:23,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 11:11:23,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552492982] [2021-12-17 11:11:23,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 11:11:23,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 11:11:23,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 11:11:23,710 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 11:11:23,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-17 11:11:23,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 11:11:23,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:11:23,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-17 11:11:23,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:11:25,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 11:11:25,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 11:11:25,055 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 11:11:25,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 13 [2021-12-17 11:11:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 11:11:25,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:11:25,983 INFO L354 Elim1Store]: treesize reduction 79, result has 16.0 percent of original size [2021-12-17 11:11:25,984 INFO L388 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 39 treesize of output 22 [2021-12-17 11:11:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 11:11:26,290 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 11:11:26,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552492982] [2021-12-17 11:11:26,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552492982] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:11:26,290 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:11:26,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 27 [2021-12-17 11:11:26,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345605117] [2021-12-17 11:11:26,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:11:26,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-17 11:11:26,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 11:11:26,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-17 11:11:26,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2021-12-17 11:11:26,291 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 24 states have internal predecessors, (50), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 11:11:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:11:30,244 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2021-12-17 11:11:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-17 11:11:30,246 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 24 states have internal predecessors, (50), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 40 [2021-12-17 11:11:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:11:30,246 INFO L225 Difference]: With dead ends: 156 [2021-12-17 11:11:30,246 INFO L226 Difference]: Without dead ends: 154 [2021-12-17 11:11:30,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=341, Invalid=2415, Unknown=0, NotChecked=0, Total=2756 [2021-12-17 11:11:30,248 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 139 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-17 11:11:30,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 611 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 546 Invalid, 0 Unknown, 99 Unchecked, 1.2s Time] [2021-12-17 11:11:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-17 11:11:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2021-12-17 11:11:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.1162790697674418) internal successors, (96), 91 states have internal predecessors, (96), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-17 11:11:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2021-12-17 11:11:30,266 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 40 [2021-12-17 11:11:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:11:30,266 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2021-12-17 11:11:30,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 24 states have internal predecessors, (50), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 11:11:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2021-12-17 11:11:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 11:11:30,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:11:30,267 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:11:30,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-17 11:11:30,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 11:11:30,478 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:11:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:11:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash -651948597, now seen corresponding path program 1 times [2021-12-17 11:11:30,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 11:11:30,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470151266] [2021-12-17 11:11:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:11:30,479 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 11:11:30,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 11:11:30,480 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 11:11:30,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-17 11:11:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:11:30,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 11:11:30,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:12:30,567 WARN L227 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:12:39,161 WARN L227 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:12:45,676 WARN L227 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:12:52,432 WARN L227 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 338 DAG size of output: 322 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-17 11:12:52,434 INFO L354 Elim1Store]: treesize reduction 104, result has 91.2 percent of original size [2021-12-17 11:12:52,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 169 treesize of output 1115 Killed by 15