./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 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/uthash-2.0.2/uthash_FNV_test7-1.i -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 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 00:45:15,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 00:45:15,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 00:45:15,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 00:45:15,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 00:45:15,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 00:45:15,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 00:45:15,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 00:45:15,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 00:45:15,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 00:45:15,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 00:45:15,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 00:45:15,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 00:45:15,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 00:45:15,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 00:45:15,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 00:45:15,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 00:45:15,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 00:45:15,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 00:45:15,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 00:45:15,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 00:45:15,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 00:45:15,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 00:45:15,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 00:45:15,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 00:45:15,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 00:45:15,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 00:45:15,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 00:45:15,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 00:45:15,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 00:45:15,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 00:45:15,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 00:45:15,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 00:45:15,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 00:45:15,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 00:45:15,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 00:45:15,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 00:45:15,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 00:45:15,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 00:45:15,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 00:45:15,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 00:45:15,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-06 00:45:15,702 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 00:45:15,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 00:45:15,703 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 00:45:15,703 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 00:45:15,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 00:45:15,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 00:45:15,704 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 00:45:15,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 00:45:15,705 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 00:45:15,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 00:45:15,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 00:45:15,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 00:45:15,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 00:45:15,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 00:45:15,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 00:45:15,706 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 00:45:15,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 00:45:15,706 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 00:45:15,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 00:45:15,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 00:45:15,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 00:45:15,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 00:45:15,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:45:15,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 00:45:15,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 00:45:15,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 00:45:15,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 00:45:15,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 00:45:15,708 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 00:45:15,708 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 00:45:15,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 00:45:15,708 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 00:45:15,709 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 -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2021-11-06 00:45:15,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 00:45:15,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 00:45:15,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 00:45:15,975 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 00:45:15,977 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 00:45:15,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2021-11-06 00:45:16,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94aa0cb66/dc9ab6c20a334a368d07a1db7cfaa21f/FLAGa8021c48a [2021-11-06 00:45:16,463 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 00:45:16,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2021-11-06 00:45:16,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94aa0cb66/dc9ab6c20a334a368d07a1db7cfaa21f/FLAGa8021c48a [2021-11-06 00:45:16,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94aa0cb66/dc9ab6c20a334a368d07a1db7cfaa21f [2021-11-06 00:45:16,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 00:45:16,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 00:45:16,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 00:45:16,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 00:45:16,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 00:45:16,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:45:16" (1/1) ... [2021-11-06 00:45:16,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4149a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:16, skipping insertion in model container [2021-11-06 00:45:16,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:45:16" (1/1) ... [2021-11-06 00:45:16,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 00:45:16,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 00:45:16,797 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2021-11-06 00:45:16,884 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2021-11-06 00:45:16,885 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2021-11-06 00:45:16,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:45:16,899 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 00:45:16,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2021-11-06 00:45:16,962 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2021-11-06 00:45:16,963 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2021-11-06 00:45:16,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:45:17,002 INFO L208 MainTranslator]: Completed translation [2021-11-06 00:45:17,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17 WrapperNode [2021-11-06 00:45:17,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 00:45:17,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 00:45:17,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 00:45:17,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 00:45:17,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 00:45:17,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 00:45:17,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 00:45:17,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 00:45:17,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 00:45:17,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 00:45:17,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 00:45:17,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 00:45:17,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (1/1) ... [2021-11-06 00:45:17,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:45:17,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:17,211 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-11-06 00:45:17,226 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-11-06 00:45:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 00:45:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 00:45:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 00:45:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 00:45:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 00:45:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 00:45:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 00:45:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 00:45:17,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 00:45:17,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 00:45:17,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 00:45:18,062 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:45:18,063 INFO L299 CfgBuilder]: Removed 73 assume(true) statements. [2021-11-06 00:45:18,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:45:18 BoogieIcfgContainer [2021-11-06 00:45:18,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:45:18,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:45:18,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:45:18,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:45:18,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:45:16" (1/3) ... [2021-11-06 00:45:18,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eb0512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:45:18, skipping insertion in model container [2021-11-06 00:45:18,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:17" (2/3) ... [2021-11-06 00:45:18,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eb0512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:45:18, skipping insertion in model container [2021-11-06 00:45:18,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:45:18" (3/3) ... [2021-11-06 00:45:18,069 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-1.i [2021-11-06 00:45:18,072 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:45:18,073 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-06 00:45:18,102 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:45:18,106 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-11-06 00:45:18,106 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-06 00:45:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 179 states have (on average 1.7094972067039107) internal successors, (306), 181 states have internal predecessors, (306), 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-11-06 00:45:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-06 00:45:18,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:18,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:18,122 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:18,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-06 00:45:18,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:18,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583173299] [2021-11-06 00:45:18,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:18,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:18,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:18,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583173299] [2021-11-06 00:45:18,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583173299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:18,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:18,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 00:45:18,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541080185] [2021-11-06 00:45:18,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:18,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 00:45:18,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:45:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 00:45:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:45:18,284 INFO L87 Difference]: Start difference. First operand has 182 states, 179 states have (on average 1.7094972067039107) internal successors, (306), 181 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-06 00:45:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:18,327 INFO L93 Difference]: Finished difference Result 361 states and 609 transitions. [2021-11-06 00:45:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 00:45:18,330 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-06 00:45:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:18,338 INFO L225 Difference]: With dead ends: 361 [2021-11-06 00:45:18,339 INFO L226 Difference]: Without dead ends: 177 [2021-11-06 00:45:18,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:45:18,345 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.85ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:18,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.85ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 00:45:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-06 00:45:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-06 00:45:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 176 states have internal predecessors, (232), 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-11-06 00:45:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-06 00:45:18,392 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-06 00:45:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:18,393 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-06 00:45:18,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-06 00:45:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-06 00:45:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 00:45:18,394 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:18,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:18,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 00:45:18,394 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:18,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-06 00:45:18,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:18,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602524375] [2021-11-06 00:45:18,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:18,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:18,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:18,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602524375] [2021-11-06 00:45:18,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602524375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:18,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:18,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:45:18,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907174937] [2021-11-06 00:45:18,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:18,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:45:18,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:45:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:45:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:45:18,490 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-06 00:45:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:18,782 INFO L93 Difference]: Finished difference Result 382 states and 501 transitions. [2021-11-06 00:45:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:45:18,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-06 00:45:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:18,784 INFO L225 Difference]: With dead ends: 382 [2021-11-06 00:45:18,784 INFO L226 Difference]: Without dead ends: 295 [2021-11-06 00:45:18,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.15ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:45:18,786 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 146 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 212.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.85ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 256.84ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:18,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 564 Invalid, 158 Unknown, 0 Unchecked, 5.85ms Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 256.84ms Time] [2021-11-06 00:45:18,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-06 00:45:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 179. [2021-11-06 00:45:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 178 states have internal predecessors, (234), 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-11-06 00:45:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-06 00:45:18,801 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-06 00:45:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:18,801 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-06 00:45:18,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-06 00:45:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-06 00:45:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:45:18,803 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:18,803 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:18,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 00:45:18,815 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-06 00:45:18,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:18,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537085733] [2021-11-06 00:45:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:18,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:18,849 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:45:18,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634361664] [2021-11-06 00:45:18,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:18,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:18,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:18,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:45:18,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 00:45:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:19,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:19,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:19,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:45:19,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:19,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537085733] [2021-11-06 00:45:19,116 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:45:19,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634361664] [2021-11-06 00:45:19,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634361664] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:19,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:19,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:45:19,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272104116] [2021-11-06 00:45:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:19,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:45:19,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:45:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:45:19,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:45:19,117 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-11-06 00:45:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:19,161 INFO L93 Difference]: Finished difference Result 375 states and 495 transitions. [2021-11-06 00:45:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:45:19,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:45:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:19,163 INFO L225 Difference]: With dead ends: 375 [2021-11-06 00:45:19,163 INFO L226 Difference]: Without dead ends: 200 [2021-11-06 00:45:19,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.44ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:45:19,164 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.77ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.92ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:19,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 409 Invalid, 72 Unknown, 0 Unchecked, 0.77ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 38.92ms Time] [2021-11-06 00:45:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-06 00:45:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2021-11-06 00:45:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 1.2893401015228427) internal successors, (254), 198 states have internal predecessors, (254), 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-11-06 00:45:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 254 transitions. [2021-11-06 00:45:19,170 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 254 transitions. Word has length 62 [2021-11-06 00:45:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:19,170 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 254 transitions. [2021-11-06 00:45:19,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-11-06 00:45:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 254 transitions. [2021-11-06 00:45:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:45:19,171 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:19,171 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:19,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:19,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:19,388 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1305568807, now seen corresponding path program 1 times [2021-11-06 00:45:19,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:19,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098225383] [2021-11-06 00:45:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:19,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:19,404 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:45:19,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163342929] [2021-11-06 00:45:19,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:19,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:19,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:19,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:45:19,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 00:45:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:19,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:19,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:19,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:45:19,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:19,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098225383] [2021-11-06 00:45:19,634 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:45:19,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163342929] [2021-11-06 00:45:19,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163342929] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:19,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:19,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:45:19,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763417379] [2021-11-06 00:45:19,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:19,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:45:19,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:45:19,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:45:19,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:45:19,636 INFO L87 Difference]: Start difference. First operand 199 states and 254 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-11-06 00:45:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:19,682 INFO L93 Difference]: Finished difference Result 386 states and 496 transitions. [2021-11-06 00:45:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:45:19,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:45:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:19,684 INFO L225 Difference]: With dead ends: 386 [2021-11-06 00:45:19,684 INFO L226 Difference]: Without dead ends: 191 [2021-11-06 00:45:19,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:45:19,685 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 220 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.16ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.69ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:19,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 420 Invalid, 66 Unknown, 0 Unchecked, 1.16ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 36.69ms Time] [2021-11-06 00:45:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-06 00:45:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2021-11-06 00:45:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 1.273224043715847) internal successors, (233), 184 states have internal predecessors, (233), 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-11-06 00:45:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2021-11-06 00:45:19,690 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 62 [2021-11-06 00:45:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:19,690 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2021-11-06 00:45:19,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-11-06 00:45:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2021-11-06 00:45:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:45:19,692 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:19,692 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:19,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:19,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-11-06 00:45:19,900 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:19,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-06 00:45:19,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:19,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78676634] [2021-11-06 00:45:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:19,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:19,911 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:45:19,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561974384] [2021-11-06 00:45:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:19,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:19,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:45:19,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 00:45:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:20,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:45:20,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:20,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:45:20,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:20,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78676634] [2021-11-06 00:45:20,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:45:20,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561974384] [2021-11-06 00:45:20,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561974384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:20,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:20,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:45:20,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329490298] [2021-11-06 00:45:20,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:20,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:45:20,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:45:20,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:45:20,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:45:20,251 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-11-06 00:45:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:20,307 INFO L93 Difference]: Finished difference Result 479 states and 602 transitions. [2021-11-06 00:45:20,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:45:20,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:45:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:20,309 INFO L225 Difference]: With dead ends: 479 [2021-11-06 00:45:20,309 INFO L226 Difference]: Without dead ends: 298 [2021-11-06 00:45:20,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.13ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:45:20,310 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 105 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.91ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.31ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:20,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 463 Invalid, 32 Unknown, 0 Unchecked, 0.91ms Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 49.31ms Time] [2021-11-06 00:45:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-06 00:45:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2021-11-06 00:45:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 289 states have (on average 1.2664359861591696) internal successors, (366), 290 states have internal predecessors, (366), 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-11-06 00:45:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 366 transitions. [2021-11-06 00:45:20,316 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 366 transitions. Word has length 62 [2021-11-06 00:45:20,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:20,316 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 366 transitions. [2021-11-06 00:45:20,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-11-06 00:45:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 366 transitions. [2021-11-06 00:45:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 00:45:20,317 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:20,318 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:20,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:20,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:20,532 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:20,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-06 00:45:20,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:20,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905975911] [2021-11-06 00:45:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:20,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:20,542 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:45:20,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711218592] [2021-11-06 00:45:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:20,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:20,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:20,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:45:20,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 00:45:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:20,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:20,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:20,784 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 11 treesize of output 7 [2021-11-06 00:45:20,808 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-11-06 00:45:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:45:20,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:45:20,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:20,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905975911] [2021-11-06 00:45:20,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:45:20,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711218592] [2021-11-06 00:45:20,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711218592] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:20,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:20,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:45:20,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105241095] [2021-11-06 00:45:20,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:20,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:45:20,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:45:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:45:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:45:20,821 INFO L87 Difference]: Start difference. First operand 291 states and 366 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11-06 00:45:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:21,031 INFO L93 Difference]: Finished difference Result 379 states and 483 transitions. [2021-11-06 00:45:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:45:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 00:45:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:21,033 INFO L225 Difference]: With dead ends: 379 [2021-11-06 00:45:21,033 INFO L226 Difference]: Without dead ends: 375 [2021-11-06 00:45:21,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.53ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:45:21,034 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 135 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 159.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.20ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 192.80ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:21,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 564 Invalid, 137 Unknown, 0 Unchecked, 2.20ms Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 192.80ms Time] [2021-11-06 00:45:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-06 00:45:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 293. [2021-11-06 00:45:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 291 states have (on average 1.2646048109965635) internal successors, (368), 292 states have internal predecessors, (368), 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-11-06 00:45:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 368 transitions. [2021-11-06 00:45:21,041 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 368 transitions. Word has length 69 [2021-11-06 00:45:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:21,041 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 368 transitions. [2021-11-06 00:45:21,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11-06 00:45:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 368 transitions. [2021-11-06 00:45:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:45:21,042 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:21,042 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:21,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:21,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:21,251 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2000986198, now seen corresponding path program 1 times [2021-11-06 00:45:21,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:21,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444045647] [2021-11-06 00:45:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:21,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:21,261 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:45:21,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064812743] [2021-11-06 00:45:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:21,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:21,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:21,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:45:21,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 00:45:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:21,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:21,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:45:21,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:45:21,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:21,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444045647] [2021-11-06 00:45:21,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:45:21,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064812743] [2021-11-06 00:45:21,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064812743] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:21,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:21,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:45:21,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365857919] [2021-11-06 00:45:21,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:21,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:45:21,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:45:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:45:21,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:45:21,526 INFO L87 Difference]: Start difference. First operand 293 states and 368 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11-06 00:45:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:21,575 INFO L93 Difference]: Finished difference Result 483 states and 627 transitions. [2021-11-06 00:45:21,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:45:21,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:45:21,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:21,576 INFO L225 Difference]: With dead ends: 483 [2021-11-06 00:45:21,576 INFO L226 Difference]: Without dead ends: 335 [2021-11-06 00:45:21,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.43ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:45:21,577 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.79ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.02ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:21,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 395 Invalid, 72 Unknown, 0 Unchecked, 0.79ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 43.02ms Time] [2021-11-06 00:45:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-06 00:45:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2021-11-06 00:45:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 332 states have internal predecessors, (408), 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-11-06 00:45:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 408 transitions. [2021-11-06 00:45:21,583 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 408 transitions. Word has length 103 [2021-11-06 00:45:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:21,583 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 408 transitions. [2021-11-06 00:45:21,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11-06 00:45:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 408 transitions. [2021-11-06 00:45:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:45:21,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:21,584 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:21,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:21,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:21,802 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:21,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1973776046, now seen corresponding path program 1 times [2021-11-06 00:45:21,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:21,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157209113] [2021-11-06 00:45:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:21,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:21,812 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:45:21,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574417556] [2021-11-06 00:45:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:21,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:21,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:21,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:45:21,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 00:45:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:21,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:21,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:45:22,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:45:22,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:22,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157209113] [2021-11-06 00:45:22,078 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:45:22,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574417556] [2021-11-06 00:45:22,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574417556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:22,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:22,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:45:22,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60296038] [2021-11-06 00:45:22,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:22,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:45:22,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:45:22,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:45:22,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:45:22,079 INFO L87 Difference]: Start difference. First operand 333 states and 408 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-11-06 00:45:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:22,136 INFO L93 Difference]: Finished difference Result 498 states and 622 transitions. [2021-11-06 00:45:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:45:22,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:45:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:22,138 INFO L225 Difference]: With dead ends: 498 [2021-11-06 00:45:22,138 INFO L226 Difference]: Without dead ends: 310 [2021-11-06 00:45:22,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.56ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:45:22,139 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 103 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.99ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.31ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:22,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 510 Invalid, 66 Unknown, 0 Unchecked, 0.99ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 47.31ms Time] [2021-11-06 00:45:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-06 00:45:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 305. [2021-11-06 00:45:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 303 states have (on average 1.2079207920792079) internal successors, (366), 304 states have internal predecessors, (366), 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-11-06 00:45:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 366 transitions. [2021-11-06 00:45:22,144 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 366 transitions. Word has length 103 [2021-11-06 00:45:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:22,144 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 366 transitions. [2021-11-06 00:45:22,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-11-06 00:45:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 366 transitions. [2021-11-06 00:45:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:45:22,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:22,145 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:22,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:22,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:22,346 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:22,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1090927200, now seen corresponding path program 1 times [2021-11-06 00:45:22,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:22,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241249874] [2021-11-06 00:45:22,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:22,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:22,358 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:45:22,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1116886516] [2021-11-06 00:45:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:22,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:22,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:22,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:45:22,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 00:45:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:22,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:45:22,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:22,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:45:22,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:22,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241249874] [2021-11-06 00:45:22,630 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:45:22,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116886516] [2021-11-06 00:45:22,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116886516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:22,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:22,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:45:22,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917023595] [2021-11-06 00:45:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:22,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:45:22,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:45:22,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:45:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:45:22,633 INFO L87 Difference]: Start difference. First operand 305 states and 366 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-11-06 00:45:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:22,797 INFO L93 Difference]: Finished difference Result 653 states and 790 transitions. [2021-11-06 00:45:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:45:22,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:45:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:22,799 INFO L225 Difference]: With dead ends: 653 [2021-11-06 00:45:22,799 INFO L226 Difference]: Without dead ends: 396 [2021-11-06 00:45:22,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:45:22,800 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 416 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.63ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 144.68ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:22,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 365 Invalid, 77 Unknown, 0 Unchecked, 1.63ms Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 144.68ms Time] [2021-11-06 00:45:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-06 00:45:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2021-11-06 00:45:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 387 states have (on average 1.2144702842377262) internal successors, (470), 388 states have internal predecessors, (470), 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-11-06 00:45:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 470 transitions. [2021-11-06 00:45:22,807 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 470 transitions. Word has length 103 [2021-11-06 00:45:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:22,808 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 470 transitions. [2021-11-06 00:45:22,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-11-06 00:45:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 470 transitions. [2021-11-06 00:45:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-06 00:45:22,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:22,808 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:22,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:23,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:23,009 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash 541561274, now seen corresponding path program 1 times [2021-11-06 00:45:23,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:45:23,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264336164] [2021-11-06 00:45:23,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:23,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:45:23,019 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:45:23,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214423551] [2021-11-06 00:45:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:23,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:45:23,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:23,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:45:23,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 00:45:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:23,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-06 00:45:23,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:23,177 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 11 treesize of output 7 [2021-11-06 00:45:23,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-06 00:45:23,216 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 00:45:23,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-06 00:45:23,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-11-06 00:45:23,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2021-11-06 00:45:23,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2021-11-06 00:45:23,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:23,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2021-11-06 00:45:24,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 00:45:24,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:24,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:24,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:24,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:24,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:24,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:24,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-06 00:45:24,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2021-11-06 00:45:24,080 INFO L354 Elim1Store]: treesize reduction 70, result has 23.1 percent of original size [2021-11-06 00:45:24,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 52 [2021-11-06 00:45:25,300 INFO L354 Elim1Store]: treesize reduction 364, result has 11.9 percent of original size [2021-11-06 00:45:25,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 2853 treesize of output 2296 [2021-11-06 00:45:25,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:25,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:25,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:45:29,535 INFO L354 Elim1Store]: treesize reduction 7776, result has 3.0 percent of original size [2021-11-06 00:45:29,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 3322 treesize of output 1825 [2021-11-06 00:45:29,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:45:29,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264336164] [2021-11-06 00:45:29,584 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:45:29,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214423551] [2021-11-06 00:45:29,584 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-06 00:45:29,584 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:29,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 00:45:29,584 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-06 00:45:29,585 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 00:45:29,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-06 00:45:29,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-06 00:45:29,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-06 00:45:29,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-06 00:45:29,811 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:29,813 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 00:45:29,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:45:29 BoogieIcfgContainer [2021-11-06 00:45:29,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 00:45:29,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 00:45:29,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 00:45:29,835 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 00:45:29,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:45:18" (3/4) ... [2021-11-06 00:45:29,837 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 00:45:29,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 00:45:29,838 INFO L158 Benchmark]: Toolchain (without parser) took 13337.95ms. Allocated memory was 60.8MB in the beginning and 148.9MB in the end (delta: 88.1MB). Free memory was 37.2MB in the beginning and 50.2MB in the end (delta: -12.9MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2021-11-06 00:45:29,838 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 00:45:29,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.72ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 37.1MB in the beginning and 58.1MB in the end (delta: -21.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2021-11-06 00:45:29,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.38ms. Allocated memory is still 81.8MB. Free memory was 58.1MB in the beginning and 51.6MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-06 00:45:29,839 INFO L158 Benchmark]: Boogie Preprocessor took 106.03ms. Allocated memory is still 81.8MB. Free memory was 51.2MB in the beginning and 44.4MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-06 00:45:29,839 INFO L158 Benchmark]: RCFGBuilder took 880.67ms. Allocated memory is still 81.8MB. Free memory was 44.4MB in the beginning and 45.5MB in the end (delta: -1.1MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2021-11-06 00:45:29,847 INFO L158 Benchmark]: TraceAbstraction took 11768.25ms. Allocated memory was 81.8MB in the beginning and 148.9MB in the end (delta: 67.1MB). Free memory was 45.1MB in the beginning and 50.2MB in the end (delta: -5.0MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2021-11-06 00:45:29,847 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 148.9MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 00:45:29,848 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.40ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.72ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 37.1MB in the beginning and 58.1MB in the end (delta: -21.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.38ms. Allocated memory is still 81.8MB. Free memory was 58.1MB in the beginning and 51.6MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.03ms. Allocated memory is still 81.8MB. Free memory was 51.2MB in the beginning and 44.4MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 880.67ms. Allocated memory is still 81.8MB. Free memory was 44.4MB in the beginning and 45.5MB in the end (delta: -1.1MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11768.25ms. Allocated memory was 81.8MB in the beginning and 148.9MB in the end (delta: 67.1MB). Free memory was 45.1MB in the beginning and 50.2MB in the end (delta: -5.0MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 148.9MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 730]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of bitwiseXor at line 725, overapproximation of bitwiseAnd at line 725. Possible FailurePath: [L713] int i; [L714] example_user_t *user, *tmp, *users=((void *)0); [L715] i=0 [L715] EXPR \read(i) [L715] COND TRUE i<1000 [L716] user = (example_user_t*)malloc(sizeof(example_user_t)) [L717] COND FALSE !(user == ((void *)0)) [L720] EXPR \read(i) [L720] user->id = i [L721] EXPR \read(i) [L721] EXPR \read(i) [L721] user->cookie = i*i [L722] unsigned _ha_hashv; [L722] unsigned _hj_i,_hj_j,_hj_k; [L722] unsigned const char *_hj_key=(unsigned const char*)(&((user)->id)); [L722] _ha_hashv = 0xfeedbeefu [L722] EXPR _hj_j = 0x9e3779b9u [L722] _hj_i = _hj_j = 0x9e3779b9u [L722] _hj_k = (unsigned)(sizeof(int)) [L722] COND FALSE !(_hj_k >= 12U) [L722] _ha_hashv += (unsigned)(sizeof(int)) [L722] case 11: [L722] case 10: [L722] case 9: [L722] case 8: [L722] case 7: [L722] case 6: [L722] case 5: [L722] case 4: [L722] EXPR _hj_key[3] [L722] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L722] case 3: [L722] EXPR _hj_key[2] [L722] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L722] case 2: [L722] EXPR _hj_key[1] [L722] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L722] case 1: [L722] EXPR _hj_key[0] [L722] _hj_i += _hj_key[0] [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 13 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 8 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 13 ) [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 12 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 16 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 5 ) [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 3 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 10 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 15 ) [L722] (user)->hh.hashv = (_ha_hashv) [L722] (user)->hh.key = (char*) (&((user)->id)) [L722] (user)->hh.keylen = (unsigned) (sizeof(int)) [L722] COND TRUE !(users) [L722] (user)->hh.next = ((void *)0) [L722] (user)->hh.prev = ((void *)0) [L722] (user)->hh.tbl = (UT_hash_table*)malloc(sizeof(UT_hash_table)) [L722] EXPR (user)->hh.tbl [L722] COND FALSE !(!(user)->hh.tbl) [L722] (user)->hh.tbl [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->tail = &((user)->hh) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->num_buckets = 32U [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->log2_num_buckets = 5U [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->hho = (char*)(&(user)->hh) - (char*)(user) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->buckets = (UT_hash_bucket*)malloc(32U * sizeof(struct UT_hash_bucket)) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->signature = 0xa0111fe1u [L722] EXPR (user)->hh.tbl [L722] EXPR (user)->hh.tbl->buckets [L722] COND FALSE !(!(user)->hh.tbl->buckets) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->buckets [L722] (users) = (user) [L722] unsigned _ha_bkt; [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->num_items [L722] (users)->hh.tbl->num_items++ [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->num_buckets [L722] _ha_bkt = ((_ha_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->buckets [L722] UT_hash_bucket *_ha_head = &((users)->hh.tbl->buckets[_ha_bkt]); [L722] EXPR _ha_head->count [L722] _ha_head->count++ [L722] EXPR _ha_head->hh_head [L722] (&(user)->hh)->hh_next = _ha_head->hh_head [L722] (&(user)->hh)->hh_prev = ((void *)0) [L722] EXPR _ha_head->hh_head [L722] COND FALSE !(_ha_head->hh_head != ((void *)0)) [L722] _ha_head->hh_head = (&(user)->hh) [L722] EXPR _ha_head->count [L722] EXPR _ha_head->expand_mult [L722] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L722] EXPR (&(user)->hh)->tbl [L722] EXPR (&(user)->hh)->tbl->noexpand [L722] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L722] COND FALSE !((_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand) [L715] EXPR \read(i) [L715] i++ [L715] EXPR \read(i) [L715] COND FALSE !(i<1000) [L724] i=0 [L724] EXPR \read(i) [L724] COND TRUE i<1000 [L725] unsigned _hf_hashv; [L725] unsigned _hj_i,_hj_j,_hj_k; [L725] unsigned const char *_hj_key=(unsigned const char*)(&i); [L725] _hf_hashv = 0xfeedbeefu [L725] EXPR _hj_j = 0x9e3779b9u [L725] _hj_i = _hj_j = 0x9e3779b9u [L725] _hj_k = (unsigned)(sizeof(int)) [L725] COND FALSE !(_hj_k >= 12U) [L725] _hf_hashv += (unsigned)(sizeof(int)) [L725] case 11: [L725] case 10: [L725] case 9: [L725] case 8: [L725] case 7: [L725] case 6: [L725] case 5: [L725] case 4: [L725] EXPR _hj_key[3] [L725] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L725] case 3: [L725] EXPR _hj_key[2] [L725] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L725] case 2: [L725] EXPR _hj_key[1] [L725] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L725] case 1: [L725] EXPR _hj_key[0] [L725] _hj_i += _hj_key[0] [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 13 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 8 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 13 ) [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 12 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 16 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 5 ) [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 3 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 10 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 15 ) [L725] (tmp) = ((void *)0) [L725] COND TRUE \read(*users) [L725] unsigned _hf_bkt; [L725] EXPR (users)->hh.tbl [L725] EXPR (users)->hh.tbl->num_buckets [L725] _hf_bkt = ((_hf_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L725] EXPR (users)->hh.tbl [L725] EXPR (users)->hh.tbl->buckets [L725] EXPR ((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head [L725] COND FALSE !(((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head != ((void *)0)) [L725] (tmp) = ((void *)0) [L725] COND FALSE !((tmp) != ((void *)0)) [L726] COND FALSE !(tmp != ((void *)0)) [L730] reach_error() - UnprovableResult [Line: 734]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 182 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11711.22ms, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 12.95ms, AutomataDifference: 1044.89ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 8.34ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1143 SdHoareTripleChecker+Valid, 809.57ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1143 mSDsluCounter, 3926 SdHoareTripleChecker+Invalid, 660.27ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1958 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 561 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 1968 mSDtfsCounter, 561 mSolverCounterSat, 17.15ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.84ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=9, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 88.11ms AutomataMinimizationTime, 9 MinimizatonAttempts, 226 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 312.69ms SsaConstructionTime, 344.20ms SatisfiabilityAnalysisTime, 7585.20ms InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2243 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-06 00:45:29,880 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/uthash-2.0.2/uthash_FNV_test7-1.i -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 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 00:45:31,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 00:45:31,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 00:45:31,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 00:45:31,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 00:45:31,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 00:45:31,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 00:45:31,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 00:45:31,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 00:45:31,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 00:45:31,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 00:45:31,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 00:45:31,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 00:45:31,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 00:45:31,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 00:45:31,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 00:45:31,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 00:45:31,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 00:45:31,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 00:45:31,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 00:45:31,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 00:45:31,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 00:45:31,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 00:45:31,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 00:45:31,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 00:45:31,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 00:45:31,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 00:45:31,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 00:45:31,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 00:45:31,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 00:45:31,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 00:45:31,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 00:45:31,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 00:45:31,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 00:45:31,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 00:45:31,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 00:45:31,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 00:45:31,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 00:45:31,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 00:45:31,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 00:45:31,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 00:45:31,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-06 00:45:31,529 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 00:45:31,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 00:45:31,530 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 00:45:31,530 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 00:45:31,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 00:45:31,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 00:45:31,531 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 00:45:31,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 00:45:31,531 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 00:45:31,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 00:45:31,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 00:45:31,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 00:45:31,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 00:45:31,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 00:45:31,531 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 00:45:31,532 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 00:45:31,532 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 00:45:31,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 00:45:31,532 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 00:45:31,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 00:45:31,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 00:45:31,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 00:45:31,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 00:45:31,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:45:31,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 00:45:31,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 00:45:31,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 00:45:31,533 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 00:45:31,533 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 00:45:31,533 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 00:45:31,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 00:45:31,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 00:45:31,533 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 00:45:31,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 00:45:31,533 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 -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2021-11-06 00:45:31,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 00:45:31,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 00:45:31,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 00:45:31,790 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 00:45:31,791 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 00:45:31,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2021-11-06 00:45:31,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d41e7742/302b3f6a62b344768abdadf2befd4014/FLAGee93797e6 [2021-11-06 00:45:32,255 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 00:45:32,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2021-11-06 00:45:32,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d41e7742/302b3f6a62b344768abdadf2befd4014/FLAGee93797e6 [2021-11-06 00:45:32,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d41e7742/302b3f6a62b344768abdadf2befd4014 [2021-11-06 00:45:32,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 00:45:32,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 00:45:32,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 00:45:32,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 00:45:32,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 00:45:32,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:32,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364a051e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32, skipping insertion in model container [2021-11-06 00:45:32,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:32,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 00:45:32,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 00:45:32,664 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2021-11-06 00:45:32,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2021-11-06 00:45:32,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2021-11-06 00:45:32,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:45:32,781 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 00:45:32,797 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2021-11-06 00:45:32,843 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2021-11-06 00:45:32,844 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2021-11-06 00:45:32,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:45:32,881 INFO L208 MainTranslator]: Completed translation [2021-11-06 00:45:32,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32 WrapperNode [2021-11-06 00:45:32,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 00:45:32,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 00:45:32,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 00:45:32,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 00:45:32,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:32,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:32,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 00:45:32,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 00:45:32,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 00:45:32,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 00:45:32,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:32,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:32,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:32,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:33,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:33,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:33,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:33,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 00:45:33,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 00:45:33,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 00:45:33,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 00:45:33,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (1/1) ... [2021-11-06 00:45:33,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:45:33,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:45:33,063 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-11-06 00:45:33,091 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-11-06 00:45:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 00:45:33,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 00:45:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 00:45:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 00:45:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 00:45:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 00:45:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 00:45:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 00:45:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 00:45:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 00:45:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 00:45:33,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 00:45:35,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:45:35,704 INFO L299 CfgBuilder]: Removed 73 assume(true) statements. [2021-11-06 00:45:35,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:45:35 BoogieIcfgContainer [2021-11-06 00:45:35,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:45:35,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:45:35,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:45:35,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:45:35,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:45:32" (1/3) ... [2021-11-06 00:45:35,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4387eea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:45:35, skipping insertion in model container [2021-11-06 00:45:35,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:45:32" (2/3) ... [2021-11-06 00:45:35,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4387eea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:45:35, skipping insertion in model container [2021-11-06 00:45:35,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:45:35" (3/3) ... [2021-11-06 00:45:35,711 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-1.i [2021-11-06 00:45:35,714 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:45:35,714 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-06 00:45:35,743 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:45:35,748 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-11-06 00:45:35,748 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-06 00:45:35,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 179 states have (on average 1.7094972067039107) internal successors, (306), 181 states have internal predecessors, (306), 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-11-06 00:45:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-06 00:45:35,763 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:35,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:35,764 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:35,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-06 00:45:35,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:35,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834172972] [2021-11-06 00:45:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:35,776 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:35,778 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-11-06 00:45:35,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-06 00:45:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:35,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-06 00:45:35,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:35,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:35,973 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:35,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834172972] [2021-11-06 00:45:35,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834172972] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:35,975 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:35,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 00:45:35,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559190212] [2021-11-06 00:45:35,977 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:35,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 00:45:35,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 00:45:36,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:45:36,006 INFO L87 Difference]: Start difference. First operand has 182 states, 179 states have (on average 1.7094972067039107) internal successors, (306), 181 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-06 00:45:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:36,031 INFO L93 Difference]: Finished difference Result 361 states and 609 transitions. [2021-11-06 00:45:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 00:45:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-06 00:45:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:36,039 INFO L225 Difference]: With dead ends: 361 [2021-11-06 00:45:36,039 INFO L226 Difference]: Without dead ends: 177 [2021-11-06 00:45:36,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.08ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:45:36,044 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.00ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:36,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.00ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 00:45:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-06 00:45:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-06 00:45:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 176 states have internal predecessors, (232), 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-11-06 00:45:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-06 00:45:36,084 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-06 00:45:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:36,084 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-06 00:45:36,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-06 00:45:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-06 00:45:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 00:45:36,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:36,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:36,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:36,297 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-11-06 00:45:36,297 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-06 00:45:36,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:36,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758288003] [2021-11-06 00:45:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:36,298 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:36,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:36,299 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-11-06 00:45:36,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-06 00:45:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:36,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:36,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:36,451 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 11 treesize of output 7 [2021-11-06 00:45:36,483 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-11-06 00:45:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:36,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:36,548 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:36,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758288003] [2021-11-06 00:45:36,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758288003] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:36,548 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:36,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 00:45:36,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326392293] [2021-11-06 00:45:36,549 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:36,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:45:36,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:45:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:45:36,554 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-11-06 00:45:39,355 WARN L515 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-11-06 00:45:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:40,355 INFO L93 Difference]: Finished difference Result 468 states and 614 transitions. [2021-11-06 00:45:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:45:40,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-06 00:45:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:40,359 INFO L225 Difference]: With dead ends: 468 [2021-11-06 00:45:40,359 INFO L226 Difference]: Without dead ends: 381 [2021-11-06 00:45:40,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.38ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:45:40,360 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 396 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3488.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.84ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3741.67ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:40,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 858 Invalid, 253 Unknown, 0 Unchecked, 10.84ms Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 1 Unknown, 0 Unchecked, 3741.67ms Time] [2021-11-06 00:45:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-06 00:45:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 179. [2021-11-06 00:45:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 178 states have internal predecessors, (234), 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-11-06 00:45:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-06 00:45:40,374 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-06 00:45:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:40,374 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-06 00:45:40,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-11-06 00:45:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-06 00:45:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:45:40,378 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:40,378 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:40,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:40,586 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-11-06 00:45:40,586 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-06 00:45:40,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:40,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733145964] [2021-11-06 00:45:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:40,588 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:40,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:40,589 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-11-06 00:45:40,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-06 00:45:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:40,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:40,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:40,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:41,082 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:41,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733145964] [2021-11-06 00:45:41,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733145964] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:41,083 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:41,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:45:41,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449053450] [2021-11-06 00:45:41,083 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:41,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:45:41,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:45:41,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:45:41,084 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-11-06 00:45:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:41,183 INFO L93 Difference]: Finished difference Result 363 states and 476 transitions. [2021-11-06 00:45:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:45:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:45:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:41,184 INFO L225 Difference]: With dead ends: 363 [2021-11-06 00:45:41,184 INFO L226 Difference]: Without dead ends: 188 [2021-11-06 00:45:41,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.35ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:45:41,186 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 427 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.62ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.47ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:41,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 416 Invalid, 75 Unknown, 0 Unchecked, 1.62ms Time], IncrementalHoareTripleChecker [37 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 83.47ms Time] [2021-11-06 00:45:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-06 00:45:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2021-11-06 00:45:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.2722222222222221) internal successors, (229), 181 states have internal predecessors, (229), 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-11-06 00:45:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2021-11-06 00:45:41,192 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 62 [2021-11-06 00:45:41,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:41,192 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2021-11-06 00:45:41,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-11-06 00:45:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2021-11-06 00:45:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:45:41,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:41,194 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:41,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-06 00:45:41,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:45:41,404 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:41,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:41,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-06 00:45:41,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:41,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113301459] [2021-11-06 00:45:41,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:41,405 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:41,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:41,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:45:41,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-06 00:45:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:41,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:41,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:41,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:42,143 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:42,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113301459] [2021-11-06 00:45:42,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113301459] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:42,143 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:42,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 00:45:42,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648157803] [2021-11-06 00:45:42,144 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:42,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:45:42,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:42,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:45:42,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:45:42,145 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-11-06 00:45:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:42,745 INFO L93 Difference]: Finished difference Result 470 states and 590 transitions. [2021-11-06 00:45:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:45:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:45:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:42,747 INFO L225 Difference]: With dead ends: 470 [2021-11-06 00:45:42,747 INFO L226 Difference]: Without dead ends: 292 [2021-11-06 00:45:42,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.22ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:45:42,748 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 101 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 544.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.57ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 582.95ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:42,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 451 Invalid, 36 Unknown, 0 Unchecked, 1.57ms Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 582.95ms Time] [2021-11-06 00:45:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-06 00:45:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 285. [2021-11-06 00:45:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 283 states have (on average 1.265017667844523) internal successors, (358), 284 states have internal predecessors, (358), 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-11-06 00:45:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 358 transitions. [2021-11-06 00:45:42,756 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 358 transitions. Word has length 62 [2021-11-06 00:45:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:42,757 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 358 transitions. [2021-11-06 00:45:42,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-11-06 00:45:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 358 transitions. [2021-11-06 00:45:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 00:45:42,758 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:42,758 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:42,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:42,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:45:42,964 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:42,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-06 00:45:42,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:42,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23517894] [2021-11-06 00:45:42,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:42,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:42,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:42,966 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-11-06 00:45:42,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-06 00:45:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:43,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:43,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:43,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:45:43,341 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:43,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23517894] [2021-11-06 00:45:43,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23517894] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:43,342 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:43,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:45:43,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078271084] [2021-11-06 00:45:43,342 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:43,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:45:43,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:43,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:45:43,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:45:43,343 INFO L87 Difference]: Start difference. First operand 285 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-11-06 00:45:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:43,411 INFO L93 Difference]: Finished difference Result 528 states and 673 transitions. [2021-11-06 00:45:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:45:43,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 00:45:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:43,412 INFO L225 Difference]: With dead ends: 528 [2021-11-06 00:45:43,412 INFO L226 Difference]: Without dead ends: 288 [2021-11-06 00:45:43,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.19ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:45:43,413 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.96ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.87ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:43,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 20 Unknown, 0 Unchecked, 0.96ms Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 59.87ms Time] [2021-11-06 00:45:43,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-06 00:45:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-11-06 00:45:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 286 states have (on average 1.2622377622377623) internal successors, (361), 287 states have internal predecessors, (361), 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-11-06 00:45:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 361 transitions. [2021-11-06 00:45:43,420 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 361 transitions. Word has length 69 [2021-11-06 00:45:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:43,420 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 361 transitions. [2021-11-06 00:45:43,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-11-06 00:45:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 361 transitions. [2021-11-06 00:45:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 00:45:43,425 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:43,425 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:43,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:43,641 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-11-06 00:45:43,641 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:43,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash 982130832, now seen corresponding path program 1 times [2021-11-06 00:45:43,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:43,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899830506] [2021-11-06 00:45:43,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:43,643 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:43,644 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-11-06 00:45:43,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-06 00:45:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:43,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:45:43,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 00:45:43,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 00:45:44,077 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:44,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899830506] [2021-11-06 00:45:44,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899830506] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:45:44,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:45:44,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-06 00:45:44,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710430167] [2021-11-06 00:45:44,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:45:44,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:45:44,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:45:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:45:44,078 INFO L87 Difference]: Start difference. First operand 288 states and 361 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-11-06 00:45:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:44,326 INFO L93 Difference]: Finished difference Result 537 states and 685 transitions. [2021-11-06 00:45:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 00:45:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-06 00:45:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:44,328 INFO L225 Difference]: With dead ends: 537 [2021-11-06 00:45:44,328 INFO L226 Difference]: Without dead ends: 294 [2021-11-06 00:45:44,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 133.41ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-06 00:45:44,329 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 131.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.70ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 161.89ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:44,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1067 Invalid, 57 Unknown, 0 Unchecked, 1.70ms Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 161.89ms Time] [2021-11-06 00:45:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-06 00:45:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-06 00:45:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 292 states have (on average 1.2568493150684932) internal successors, (367), 293 states have internal predecessors, (367), 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-11-06 00:45:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2021-11-06 00:45:44,336 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 72 [2021-11-06 00:45:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:44,336 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2021-11-06 00:45:44,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-11-06 00:45:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2021-11-06 00:45:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 00:45:44,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:44,337 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:44,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:44,537 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-11-06 00:45:44,537 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2058438736, now seen corresponding path program 2 times [2021-11-06 00:45:44,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:44,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864720938] [2021-11-06 00:45:44,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:45:44,539 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:44,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:44,540 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-11-06 00:45:44,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-06 00:45:44,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:45:44,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:45:44,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:44,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:44,707 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 11 treesize of output 7 [2021-11-06 00:45:44,717 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-11-06 00:45:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 00:45:44,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 00:45:44,835 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:44,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864720938] [2021-11-06 00:45:44,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864720938] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:44,835 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:44,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 00:45:44,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171836694] [2021-11-06 00:45:44,835 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:44,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:45:44,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:45:44,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:45:44,837 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-11-06 00:45:47,088 WARN L515 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-11-06 00:45:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:48,501 INFO L93 Difference]: Finished difference Result 448 states and 571 transitions. [2021-11-06 00:45:48,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:45:48,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-06 00:45:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:48,504 INFO L225 Difference]: With dead ends: 448 [2021-11-06 00:45:48,504 INFO L226 Difference]: Without dead ends: 444 [2021-11-06 00:45:48,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.53ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:45:48,504 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 338 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3460.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.60ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3620.99ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:48,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 823 Invalid, 218 Unknown, 0 Unchecked, 6.60ms Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 1 Unknown, 0 Unchecked, 3620.99ms Time] [2021-11-06 00:45:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-06 00:45:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 365. [2021-11-06 00:45:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 363 states have (on average 1.2754820936639117) internal successors, (463), 364 states have internal predecessors, (463), 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-11-06 00:45:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 463 transitions. [2021-11-06 00:45:48,518 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 463 transitions. Word has length 78 [2021-11-06 00:45:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:48,518 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 463 transitions. [2021-11-06 00:45:48,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-11-06 00:45:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 463 transitions. [2021-11-06 00:45:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 00:45:48,519 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:48,519 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:48,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:48,726 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-11-06 00:45:48,727 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:48,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1224331210, now seen corresponding path program 1 times [2021-11-06 00:45:48,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:48,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435784300] [2021-11-06 00:45:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:48,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:48,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:48,729 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-11-06 00:45:48,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 00:45:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:48,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 00:45:48,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:45:49,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:45:49,620 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:49,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435784300] [2021-11-06 00:45:49,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435784300] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:45:49,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:45:49,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-06 00:45:49,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018030903] [2021-11-06 00:45:49,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:45:49,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 00:45:49,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:49,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 00:45:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-06 00:45:49,622 INFO L87 Difference]: Start difference. First operand 365 states and 463 transitions. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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-11-06 00:45:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:51,057 INFO L93 Difference]: Finished difference Result 697 states and 901 transitions. [2021-11-06 00:45:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 00:45:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-06 00:45:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:51,059 INFO L225 Difference]: With dead ends: 697 [2021-11-06 00:45:51,059 INFO L226 Difference]: Without dead ends: 377 [2021-11-06 00:45:51,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 819.60ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-06 00:45:51,060 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 836.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.03ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 894.16ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:51,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1915 Invalid, 164 Unknown, 0 Unchecked, 3.03ms Time], IncrementalHoareTripleChecker [45 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 894.16ms Time] [2021-11-06 00:45:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-06 00:45:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-11-06 00:45:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.2666666666666666) internal successors, (475), 376 states have internal predecessors, (475), 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-11-06 00:45:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 475 transitions. [2021-11-06 00:45:51,070 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 475 transitions. Word has length 112 [2021-11-06 00:45:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:51,071 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 475 transitions. [2021-11-06 00:45:51,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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-11-06 00:45:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 475 transitions. [2021-11-06 00:45:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 00:45:51,072 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:51,072 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:51,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:51,283 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-11-06 00:45:51,284 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2016870474, now seen corresponding path program 2 times [2021-11-06 00:45:51,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:51,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088145526] [2021-11-06 00:45:51,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:45:51,285 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:51,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:51,286 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-11-06 00:45:51,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 00:45:51,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:45:51,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:45:51,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:45:51,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 00:45:51,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 00:45:51,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:51,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088145526] [2021-11-06 00:45:51,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088145526] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:45:51,746 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:45:51,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:45:51,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675400501] [2021-11-06 00:45:51,746 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:45:51,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:45:51,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:51,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:45:51,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:45:51,747 INFO L87 Difference]: Start difference. First operand 377 states and 475 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11-06 00:45:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:45:51,843 INFO L93 Difference]: Finished difference Result 603 states and 784 transitions. [2021-11-06 00:45:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:45:51,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-11-06 00:45:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:45:51,845 INFO L225 Difference]: With dead ends: 603 [2021-11-06 00:45:51,845 INFO L226 Difference]: Without dead ends: 389 [2021-11-06 00:45:51,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.78ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:45:51,847 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 101 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.14ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.85ms IncrementalHoareTripleChecker+Time [2021-11-06 00:45:51,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 604 Invalid, 68 Unknown, 0 Unchecked, 1.14ms Time], IncrementalHoareTripleChecker [30 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 77.85ms Time] [2021-11-06 00:45:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-06 00:45:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2021-11-06 00:45:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 384 states have (on average 1.1979166666666667) internal successors, (460), 385 states have internal predecessors, (460), 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-11-06 00:45:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2021-11-06 00:45:51,856 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 124 [2021-11-06 00:45:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:45:51,856 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2021-11-06 00:45:51,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11-06 00:45:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2021-11-06 00:45:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 00:45:51,859 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:45:51,859 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:45:51,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-06 00:45:52,067 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-11-06 00:45:52,068 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:45:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:45:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1333208362, now seen corresponding path program 1 times [2021-11-06 00:45:52,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:45:52,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551739055] [2021-11-06 00:45:52,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:45:52,070 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:45:52,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:45:52,071 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-11-06 00:45:52,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 00:45:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:45:52,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 00:45:52,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:45:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 00:45:52,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:45:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 00:45:53,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:45:53,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551739055] [2021-11-06 00:45:53,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551739055] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:45:53,679 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:45:53,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-06 00:45:53,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130057892] [2021-11-06 00:45:53,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:45:53,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-06 00:45:53,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:45:53,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-06 00:45:53,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-11-06 00:45:53,680 INFO L87 Difference]: Start difference. First operand 386 states and 460 transitions. Second operand has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 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-11-06 00:46:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:46:02,673 INFO L93 Difference]: Finished difference Result 751 states and 919 transitions. [2021-11-06 00:46:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 00:46:02,675 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-11-06 00:46:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:46:02,682 INFO L225 Difference]: With dead ends: 751 [2021-11-06 00:46:02,682 INFO L226 Difference]: Without dead ends: 410 [2021-11-06 00:46:02,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3922.90ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-11-06 00:46:02,683 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5755.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3223 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.22ms SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5935.12ms IncrementalHoareTripleChecker+Time [2021-11-06 00:46:02,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3223 Invalid, 520 Unknown, 0 Unchecked, 6.22ms Time], IncrementalHoareTripleChecker [157 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 5935.12ms Time] [2021-11-06 00:46:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-06 00:46:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-11-06 00:46:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 1.1862745098039216) internal successors, (484), 409 states have internal predecessors, (484), 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-11-06 00:46:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2021-11-06 00:46:02,694 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 124 [2021-11-06 00:46:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:46:02,694 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2021-11-06 00:46:02,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 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-11-06 00:46:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2021-11-06 00:46:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 00:46:02,695 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:46:02,696 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:46:02,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 00:46:02,907 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-11-06 00:46:02,908 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:46:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:46:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2039593942, now seen corresponding path program 2 times [2021-11-06 00:46:02,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:46:02,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507818859] [2021-11-06 00:46:02,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:46:02,910 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:46:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:46:02,910 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-11-06 00:46:02,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 00:46:03,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:46:03,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:46:03,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:46:03,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:46:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 00:46:03,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:46:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 00:46:03,445 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:46:03,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507818859] [2021-11-06 00:46:03,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507818859] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:46:03,445 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:46:03,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [] total 5 [2021-11-06 00:46:03,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200053078] [2021-11-06 00:46:03,446 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:46:03,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:46:03,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:46:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:46:03,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:46:03,446 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-11-06 00:46:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:46:03,499 INFO L93 Difference]: Finished difference Result 611 states and 731 transitions. [2021-11-06 00:46:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:46:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-11-06 00:46:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:46:03,501 INFO L225 Difference]: With dead ends: 611 [2021-11-06 00:46:03,501 INFO L226 Difference]: Without dead ends: 413 [2021-11-06 00:46:03,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.01ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:46:03,502 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.47ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.55ms IncrementalHoareTripleChecker+Time [2021-11-06 00:46:03,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 384 Invalid, 40 Unknown, 0 Unchecked, 0.47ms Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 43.55ms Time] [2021-11-06 00:46:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-06 00:46:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2021-11-06 00:46:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 1.1642156862745099) internal successors, (475), 409 states have internal predecessors, (475), 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-11-06 00:46:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 475 transitions. [2021-11-06 00:46:03,513 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 475 transitions. Word has length 148 [2021-11-06 00:46:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:46:03,513 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 475 transitions. [2021-11-06 00:46:03,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-11-06 00:46:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 475 transitions. [2021-11-06 00:46:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 00:46:03,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:46:03,515 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:46:03,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 00:46:03,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:46:03,723 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:46:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:46:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1997207916, now seen corresponding path program 1 times [2021-11-06 00:46:03,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:46:03,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719744713] [2021-11-06 00:46:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:46:03,724 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:46:03,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:46:03,725 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:46:03,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 00:46:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:46:03,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-06 00:46:03,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:46:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 00:46:04,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:46:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 00:46:07,506 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:46:07,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719744713] [2021-11-06 00:46:07,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719744713] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:46:07,511 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:46:07,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2021-11-06 00:46:07,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291366342] [2021-11-06 00:46:07,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:46:07,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-06 00:46:07,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:46:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-06 00:46:07,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=3099, Unknown=0, NotChecked=0, Total=4032 [2021-11-06 00:46:07,519 INFO L87 Difference]: Start difference. First operand 410 states and 475 transitions. Second operand has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 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-11-06 00:47:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:47:09,984 INFO L93 Difference]: Finished difference Result 805 states and 961 transitions. [2021-11-06 00:47:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-06 00:47:09,985 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-11-06 00:47:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:47:09,986 INFO L225 Difference]: With dead ends: 805 [2021-11-06 00:47:09,986 INFO L226 Difference]: Without dead ends: 440 [2021-11-06 00:47:09,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 24664.99ms TimeCoverageRelationStatistics Valid=2700, Invalid=6042, Unknown=0, NotChecked=0, Total=8742 [2021-11-06 00:47:09,988 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 6231 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39956.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6439 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.60ms SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40581.85ms IncrementalHoareTripleChecker+Time [2021-11-06 00:47:09,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6439 Invalid, 1623 Unknown, 0 Unchecked, 13.60ms Time], IncrementalHoareTripleChecker [555 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 40581.85ms Time] [2021-11-06 00:47:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-11-06 00:47:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-11-06 00:47:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 438 states have (on average 1.1529680365296804) internal successors, (505), 439 states have internal predecessors, (505), 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-11-06 00:47:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 505 transitions. [2021-11-06 00:47:10,004 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 505 transitions. Word has length 148 [2021-11-06 00:47:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:47:10,005 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 505 transitions. [2021-11-06 00:47:10,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 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-11-06 00:47:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 505 transitions. [2021-11-06 00:47:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-06 00:47:10,006 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:47:10,006 INFO L514 BasicCegarLoop]: trace histogram [44, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:47:10,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-06 00:47:10,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:47:10,220 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:47:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:47:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843980, now seen corresponding path program 2 times [2021-11-06 00:47:10,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:47:10,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774939932] [2021-11-06 00:47:10,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:47:10,221 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:47:10,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:47:10,222 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-11-06 00:47:10,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 00:47:10,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 00:47:10,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:47:10,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-06 00:47:10,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:47:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:47:11,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:47:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:47:15,000 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:47:15,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774939932] [2021-11-06 00:47:15,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774939932] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:47:15,001 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:47:15,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2021-11-06 00:47:15,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028406290] [2021-11-06 00:47:15,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:47:15,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-06 00:47:15,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:47:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-06 00:47:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2021-11-06 00:47:15,003 INFO L87 Difference]: Start difference. First operand 440 states and 505 transitions. Second operand has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 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-11-06 00:48:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:48:20,856 INFO L93 Difference]: Finished difference Result 868 states and 1027 transitions. [2021-11-06 00:48:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-06 00:48:20,857 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-11-06 00:48:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:48:20,858 INFO L225 Difference]: With dead ends: 868 [2021-11-06 00:48:20,858 INFO L226 Difference]: Without dead ends: 473 [2021-11-06 00:48:20,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 26524.99ms TimeCoverageRelationStatistics Valid=3199, Invalid=6113, Unknown=0, NotChecked=0, Total=9312 [2021-11-06 00:48:20,860 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 6432 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41863.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6640 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.24ms SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42586.33ms IncrementalHoareTripleChecker+Time [2021-11-06 00:48:20,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6640 Invalid, 1919 Unknown, 0 Unchecked, 12.24ms Time], IncrementalHoareTripleChecker [591 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 42586.33ms Time] [2021-11-06 00:48:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-11-06 00:48:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2021-11-06 00:48:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 471 states have (on average 1.1422505307855626) internal successors, (538), 472 states have internal predecessors, (538), 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-11-06 00:48:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 538 transitions. [2021-11-06 00:48:20,877 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 538 transitions. Word has length 178 [2021-11-06 00:48:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:48:20,877 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 538 transitions. [2021-11-06 00:48:20,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 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-11-06 00:48:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 538 transitions. [2021-11-06 00:48:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-06 00:48:20,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:48:20,879 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:48:20,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-06 00:48:21,094 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-11-06 00:48:21,094 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:48:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:48:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1145284768, now seen corresponding path program 3 times [2021-11-06 00:48:21,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:48:21,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671242821] [2021-11-06 00:48:21,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 00:48:21,096 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:48:21,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:48:21,097 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-11-06 00:48:21,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 00:48:21,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-06 00:48:21,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:48:21,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:48:21,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:48:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 00:48:21,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:48:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 00:48:22,157 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:48:22,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671242821] [2021-11-06 00:48:22,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671242821] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:48:22,157 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:48:22,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 00:48:22,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845543702] [2021-11-06 00:48:22,157 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:48:22,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:48:22,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:48:22,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:48:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:48:22,158 INFO L87 Difference]: Start difference. First operand 473 states and 538 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-11-06 00:48:24,309 WARN L515 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-11-06 00:48:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:48:24,842 INFO L93 Difference]: Finished difference Result 983 states and 1122 transitions. [2021-11-06 00:48:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:48:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2021-11-06 00:48:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:48:24,845 INFO L225 Difference]: With dead ends: 983 [2021-11-06 00:48:24,845 INFO L226 Difference]: Without dead ends: 555 [2021-11-06 00:48:24,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:48:24,846 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 395 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2554.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2653.16ms IncrementalHoareTripleChecker+Time [2021-11-06 00:48:24,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 335 Invalid, 82 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 1 Unknown, 0 Unchecked, 2653.16ms Time] [2021-11-06 00:48:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-06 00:48:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 548. [2021-11-06 00:48:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 546 states have (on average 1.1446886446886446) internal successors, (625), 547 states have internal predecessors, (625), 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-11-06 00:48:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 625 transitions. [2021-11-06 00:48:24,863 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 625 transitions. Word has length 211 [2021-11-06 00:48:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:48:24,864 INFO L470 AbstractCegarLoop]: Abstraction has 548 states and 625 transitions. [2021-11-06 00:48:24,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-11-06 00:48:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 625 transitions. [2021-11-06 00:48:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-06 00:48:24,865 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:48:24,865 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:48:24,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-06 00:48:25,079 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-11-06 00:48:25,079 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:48:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:48:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash 670931834, now seen corresponding path program 1 times [2021-11-06 00:48:25,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:48:25,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421014313] [2021-11-06 00:48:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:48:25,081 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:48:25,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:48:25,082 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-11-06 00:48:25,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-06 00:48:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:48:25,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-06 00:48:25,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:48:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:48:28,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:48:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:48:39,633 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:48:39,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421014313] [2021-11-06 00:48:39,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421014313] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:48:39,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:48:39,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2021-11-06 00:48:39,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240875728] [2021-11-06 00:48:39,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:48:39,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-11-06 00:48:39,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:48:39,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-11-06 00:48:39,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4486, Invalid=12806, Unknown=0, NotChecked=0, Total=17292 [2021-11-06 00:48:39,638 INFO L87 Difference]: Start difference. First operand 548 states and 625 transitions. Second operand has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 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-11-06 00:52:07,880 WARN L230 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 196 [2021-11-06 00:52:18,192 WARN L230 SmtUtils]: Spent 7.69s on a formula simplification that was a NOOP. DAG size: 193 [2021-11-06 00:54:21,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:54:21,246 INFO L93 Difference]: Finished difference Result 1003 states and 1217 transitions. [2021-11-06 00:54:21,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-06 00:54:21,247 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2021-11-06 00:54:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:54:21,249 INFO L225 Difference]: With dead ends: 1003 [2021-11-06 00:54:21,249 INFO L226 Difference]: Without dead ends: 614 [2021-11-06 00:54:21,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 234478.18ms TimeCoverageRelationStatistics Valid=12934, Invalid=25286, Unknown=0, NotChecked=0, Total=38220 [2021-11-06 00:54:21,257 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 13065 mSDsCounter, 0 mSdLazyCounter, 4767 mSolverCounterSat, 1119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 116914.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13273 SdHoareTripleChecker+Invalid, 5886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 29.06ms SdHoareTripleChecker+Time, 1119 IncrementalHoareTripleChecker+Valid, 4767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 119459.22ms IncrementalHoareTripleChecker+Time [2021-11-06 00:54:21,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13273 Invalid, 5886 Unknown, 0 Unchecked, 29.06ms Time], IncrementalHoareTripleChecker [1119 Valid, 4767 Invalid, 0 Unknown, 0 Unchecked, 119459.22ms Time] [2021-11-06 00:54:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-11-06 00:54:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-11-06 00:54:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 612 states have (on average 1.1290849673202614) internal successors, (691), 613 states have internal predecessors, (691), 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-11-06 00:54:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2021-11-06 00:54:21,290 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 218 [2021-11-06 00:54:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:54:21,291 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2021-11-06 00:54:21,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 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-11-06 00:54:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2021-11-06 00:54:21,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-11-06 00:54:21,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:54:21,293 INFO L514 BasicCegarLoop]: trace histogram [130, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:54:21,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-06 00:54:21,511 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-11-06 00:54:21,511 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:54:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:54:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash 249759226, now seen corresponding path program 2 times [2021-11-06 00:54:21,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:54:21,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579017879] [2021-11-06 00:54:21,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:54:21,513 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:54:21,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:54:21,514 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-11-06 00:54:21,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-06 00:54:22,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 00:54:22,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:54:23,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 133 conjunts are in the unsatisfiable core [2021-11-06 00:54:23,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:54:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:54:33,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:55:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:55:22,228 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:55:22,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579017879] [2021-11-06 00:55:22,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579017879] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:55:22,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:55:22,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 264 [2021-11-06 00:55:22,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060421303] [2021-11-06 00:55:22,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:55:22,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 264 states [2021-11-06 00:55:22,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:55:22,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 264 interpolants. [2021-11-06 00:55:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17686, Invalid=51746, Unknown=0, NotChecked=0, Total=69432 [2021-11-06 00:55:22,237 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 264 states, 264 states have (on average 1.4128787878787878) internal successors, (373), 264 states have internal predecessors, (373), 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) Killed by 15