./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-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_SFH_test3-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 f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 02:09:38,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 02:09:38,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 02:09:38,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 02:09:38,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 02:09:38,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 02:09:38,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 02:09:38,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 02:09:38,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 02:09:38,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 02:09:38,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 02:09:38,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 02:09:38,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 02:09:38,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 02:09:38,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 02:09:38,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 02:09:38,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 02:09:38,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 02:09:38,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 02:09:38,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 02:09:38,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 02:09:38,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 02:09:38,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 02:09:38,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 02:09:38,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 02:09:38,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 02:09:38,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 02:09:38,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 02:09:38,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 02:09:38,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 02:09:38,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 02:09:38,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 02:09:38,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 02:09:38,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 02:09:38,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 02:09:38,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 02:09:38,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 02:09:38,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 02:09:38,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 02:09:38,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 02:09:38,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 02:09:38,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-06 02:09:38,702 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 02:09:38,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 02:09:38,703 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 02:09:38,703 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 02:09:38,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 02:09:38,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 02:09:38,704 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 02:09:38,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 02:09:38,704 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 02:09:38,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 02:09:38,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 02:09:38,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 02:09:38,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 02:09:38,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 02:09:38,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 02:09:38,705 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 02:09:38,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 02:09:38,705 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 02:09:38,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 02:09:38,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 02:09:38,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 02:09:38,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 02:09:38,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 02:09:38,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 02:09:38,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 02:09:38,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 02:09:38,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 02:09:38,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 02:09:38,712 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 02:09:38,713 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 02:09:38,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 02:09:38,713 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 02:09:38,713 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 -> f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 [2021-11-06 02:09:38,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 02:09:39,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 02:09:39,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 02:09:39,002 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 02:09:39,003 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 02:09:39,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2021-11-06 02:09:39,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f59817cd/9d1adcc90f924a24a2247508414e5306/FLAGc775681c6 [2021-11-06 02:09:39,507 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 02:09:39,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2021-11-06 02:09:39,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f59817cd/9d1adcc90f924a24a2247508414e5306/FLAGc775681c6 [2021-11-06 02:09:39,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f59817cd/9d1adcc90f924a24a2247508414e5306 [2021-11-06 02:09:39,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 02:09:39,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 02:09:39,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 02:09:39,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 02:09:39,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 02:09:39,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:09:39" (1/1) ... [2021-11-06 02:09:39,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5941f578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:39, skipping insertion in model container [2021-11-06 02:09:39,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:09:39" (1/1) ... [2021-11-06 02:09:39,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 02:09:39,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 02:09:39,880 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_SFH_test3-1.i[33021,33034] [2021-11-06 02:09:39,980 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_SFH_test3-1.i[44590,44603] [2021-11-06 02:09:39,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 02:09:39,989 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 02:09:40,020 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_SFH_test3-1.i[33021,33034] [2021-11-06 02:09:40,069 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_SFH_test3-1.i[44590,44603] [2021-11-06 02:09:40,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 02:09:40,126 INFO L208 MainTranslator]: Completed translation [2021-11-06 02:09:40,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40 WrapperNode [2021-11-06 02:09:40,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 02:09:40,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 02:09:40,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 02:09:40,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 02:09:40,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 02:09:40,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 02:09:40,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 02:09:40,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 02:09:40,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 02:09:40,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 02:09:40,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 02:09:40,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 02:09:40,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (1/1) ... [2021-11-06 02:09:40,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 02:09:40,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:40,297 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 02:09:40,345 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 02:09:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 02:09:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 02:09:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 02:09:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 02:09:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 02:09:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 02:09:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 02:09:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 02:09:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 02:09:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 02:09:40,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 02:09:41,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 02:09:41,050 INFO L299 CfgBuilder]: Removed 85 assume(true) statements. [2021-11-06 02:09:41,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:09:41 BoogieIcfgContainer [2021-11-06 02:09:41,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 02:09:41,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 02:09:41,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 02:09:41,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 02:09:41,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 02:09:39" (1/3) ... [2021-11-06 02:09:41,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e963d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:09:41, skipping insertion in model container [2021-11-06 02:09:41,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:40" (2/3) ... [2021-11-06 02:09:41,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e963d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:09:41, skipping insertion in model container [2021-11-06 02:09:41,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:09:41" (3/3) ... [2021-11-06 02:09:41,056 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-1.i [2021-11-06 02:09:41,059 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 02:09:41,060 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-06 02:09:41,096 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 02:09:41,101 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 02:09:41,101 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-06 02:09:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 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 02:09:41,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-06 02:09:41,122 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:41,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 02:09:41,123 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash 239232295, now seen corresponding path program 1 times [2021-11-06 02:09:41,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:41,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983571262] [2021-11-06 02:09:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:41,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:41,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 02:09:41,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:41,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983571262] [2021-11-06 02:09:41,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983571262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:41,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:41,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 02:09:41,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379960546] [2021-11-06 02:09:41,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:41,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 02:09:41,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 02:09:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 02:09:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 02:09:41,278 INFO L87 Difference]: Start difference. First operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 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.5) internal successors, (9), 2 states have internal predecessors, (9), 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 02:09:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:41,316 INFO L93 Difference]: Finished difference Result 402 states and 670 transitions. [2021-11-06 02:09:41,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 02:09:41,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2021-11-06 02:09:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:41,324 INFO L225 Difference]: With dead ends: 402 [2021-11-06 02:09:41,325 INFO L226 Difference]: Without dead ends: 198 [2021-11-06 02:09:41,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.02ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 02:09:41,331 INFO L933 BasicCegarLoop]: 263 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, 263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.61ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:41,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 2.61ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 02:09:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-06 02:09:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-06 02:09:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 197 states have internal predecessors, (259), 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 02:09:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2021-11-06 02:09:41,361 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 9 [2021-11-06 02:09:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:41,361 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2021-11-06 02:09:41,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 02:09:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2021-11-06 02:09:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 02:09:41,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:41,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 02:09:41,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 02:09:41,363 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1042319138, now seen corresponding path program 1 times [2021-11-06 02:09:41,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:41,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585947096] [2021-11-06 02:09:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:41,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:41,402 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 02:09:41,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:41,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585947096] [2021-11-06 02:09:41,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585947096] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:41,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:41,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 02:09:41,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142984334] [2021-11-06 02:09:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:41,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 02:09:41,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 02:09:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 02:09:41,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 02:09:41,406 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 02:09:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:41,683 INFO L93 Difference]: Finished difference Result 445 states and 582 transitions. [2021-11-06 02:09:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 02:09:41,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2021-11-06 02:09:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:41,685 INFO L225 Difference]: With dead ends: 445 [2021-11-06 02:09:41,685 INFO L226 Difference]: Without dead ends: 337 [2021-11-06 02:09:41,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.98ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:09:41,687 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 173 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 194.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.62ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 245.98ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:41,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 642 Invalid, 161 Unknown, 0 Unchecked, 4.62ms Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 245.98ms Time] [2021-11-06 02:09:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-06 02:09:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 200. [2021-11-06 02:09:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 199 states have internal predecessors, (261), 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 02:09:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 261 transitions. [2021-11-06 02:09:41,707 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 261 transitions. Word has length 12 [2021-11-06 02:09:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:41,707 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 261 transitions. [2021-11-06 02:09:41,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 02:09:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 261 transitions. [2021-11-06 02:09:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 02:09:41,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:41,711 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] [2021-11-06 02:09:41,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 02:09:41,712 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:41,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:41,712 INFO L85 PathProgramCache]: Analyzing trace with hash 168111628, now seen corresponding path program 1 times [2021-11-06 02:09:41,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:41,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722207786] [2021-11-06 02:09:41,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:41,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:41,738 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 02:09:41,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004131261] [2021-11-06 02:09:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:41,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 02:09:41,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:41,757 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 02:09:41,759 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 02:09:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:41,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:09:41,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:09:42,059 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 02:09:42,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 02:09:42,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:42,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722207786] [2021-11-06 02:09:42,067 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 02:09:42,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004131261] [2021-11-06 02:09:42,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004131261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:42,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:42,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 02:09:42,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831527496] [2021-11-06 02:09:42,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:42,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 02:09:42,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 02:09:42,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 02:09:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 02:09:42,069 INFO L87 Difference]: Start difference. First operand 200 states and 261 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 02:09:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:42,114 INFO L93 Difference]: Finished difference Result 417 states and 549 transitions. [2021-11-06 02:09:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 02:09:42,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2021-11-06 02:09:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:42,115 INFO L225 Difference]: With dead ends: 417 [2021-11-06 02:09:42,115 INFO L226 Difference]: Without dead ends: 221 [2021-11-06 02:09:42,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.50ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 02:09:42,117 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 9 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.77ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.45ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:42,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 463 Invalid, 72 Unknown, 0 Unchecked, 0.77ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 39.45ms Time] [2021-11-06 02:09:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-06 02:09:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2021-11-06 02:09:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 214 states have (on average 1.3130841121495327) internal successors, (281), 219 states have internal predecessors, (281), 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 02:09:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 281 transitions. [2021-11-06 02:09:42,124 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 281 transitions. Word has length 64 [2021-11-06 02:09:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:42,125 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 281 transitions. [2021-11-06 02:09:42,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 02:09:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 281 transitions. [2021-11-06 02:09:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 02:09:42,126 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:42,126 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] [2021-11-06 02:09:42,147 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 02:09:42,346 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 02:09:42,347 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash 521200010, now seen corresponding path program 1 times [2021-11-06 02:09:42,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:42,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933735263] [2021-11-06 02:09:42,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:42,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:42,368 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 02:09:42,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847631872] [2021-11-06 02:09:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:42,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 02:09:42,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:42,379 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 02:09:42,384 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 02:09:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:42,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:09:42,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:09:42,629 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 02:09:42,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 02:09:42,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:42,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933735263] [2021-11-06 02:09:42,630 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 02:09:42,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847631872] [2021-11-06 02:09:42,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847631872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:42,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:42,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 02:09:42,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053612268] [2021-11-06 02:09:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:42,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 02:09:42,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 02:09:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 02:09:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 02:09:42,636 INFO L87 Difference]: Start difference. First operand 220 states and 281 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 02:09:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:42,707 INFO L93 Difference]: Finished difference Result 428 states and 550 transitions. [2021-11-06 02:09:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 02:09:42,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2021-11-06 02:09:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:42,708 INFO L225 Difference]: With dead ends: 428 [2021-11-06 02:09:42,708 INFO L226 Difference]: Without dead ends: 212 [2021-11-06 02:09:42,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.39ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:09:42,712 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 247 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.07ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.54ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:42,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 474 Invalid, 66 Unknown, 0 Unchecked, 2.07ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 57.54ms Time] [2021-11-06 02:09:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-06 02:09:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2021-11-06 02:09:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 200 states have (on average 1.3) internal successors, (260), 205 states have internal predecessors, (260), 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 02:09:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2021-11-06 02:09:42,727 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 64 [2021-11-06 02:09:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:42,728 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2021-11-06 02:09:42,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 02:09:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2021-11-06 02:09:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 02:09:42,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:42,733 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] [2021-11-06 02:09:42,755 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 02:09:42,952 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 02:09:42,953 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:42,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1012352744, now seen corresponding path program 1 times [2021-11-06 02:09:42,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:42,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513043833] [2021-11-06 02:09:42,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:42,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:42,965 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 02:09:42,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314842391] [2021-11-06 02:09:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:42,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 02:09:42,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:42,967 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 02:09:42,968 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 02:09:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:43,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 02:09:43,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:09:43,296 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 02:09:43,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 02:09:43,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:43,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513043833] [2021-11-06 02:09:43,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 02:09:43,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314842391] [2021-11-06 02:09:43,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314842391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:43,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:43,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 02:09:43,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231453909] [2021-11-06 02:09:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:43,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 02:09:43,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 02:09:43,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 02:09:43,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 02:09:43,299 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 02:09:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:43,357 INFO L93 Difference]: Finished difference Result 542 states and 683 transitions. [2021-11-06 02:09:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 02:09:43,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2021-11-06 02:09:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:43,359 INFO L225 Difference]: With dead ends: 542 [2021-11-06 02:09:43,359 INFO L226 Difference]: Without dead ends: 340 [2021-11-06 02:09:43,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.91ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 02:09:43,359 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 132 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.88ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.51ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:43,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 544 Invalid, 32 Unknown, 0 Unchecked, 0.88ms Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 44.51ms Time] [2021-11-06 02:09:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-06 02:09:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 312. [2021-11-06 02:09:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 306 states have (on average 1.2843137254901962) internal successors, (393), 311 states have internal predecessors, (393), 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 02:09:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 393 transitions. [2021-11-06 02:09:43,364 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 393 transitions. Word has length 64 [2021-11-06 02:09:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:43,365 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 393 transitions. [2021-11-06 02:09:43,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 02:09:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 393 transitions. [2021-11-06 02:09:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 02:09:43,365 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:43,365 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] [2021-11-06 02:09:43,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-06 02:09:43,582 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 02:09:43,583 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash -147792665, now seen corresponding path program 1 times [2021-11-06 02:09:43,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:43,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963642014] [2021-11-06 02:09:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:43,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:43,601 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 02:09:43,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [7917988] [2021-11-06 02:09:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:43,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 02:09:43,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:43,608 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 02:09:43,609 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 02:09:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:43,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:09:43,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:09:43,858 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 02:09:43,868 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 02:09:43,885 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 02:09:43,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 02:09:43,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:43,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963642014] [2021-11-06 02:09:43,886 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 02:09:43,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7917988] [2021-11-06 02:09:43,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7917988] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:43,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:43,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 02:09:43,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576873206] [2021-11-06 02:09:43,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:43,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 02:09:43,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 02:09:43,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 02:09:43,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 02:09:43,889 INFO L87 Difference]: Start difference. First operand 312 states and 393 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 02:09:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:44,118 INFO L93 Difference]: Finished difference Result 421 states and 537 transitions. [2021-11-06 02:09:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 02:09:44,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 71 [2021-11-06 02:09:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:44,120 INFO L225 Difference]: With dead ends: 421 [2021-11-06 02:09:44,120 INFO L226 Difference]: Without dead ends: 396 [2021-11-06 02:09:44,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.44ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:09:44,120 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 135 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 167.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.67ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 210.66ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:44,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 644 Invalid, 138 Unknown, 0 Unchecked, 1.67ms Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 210.66ms Time] [2021-11-06 02:09:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-06 02:09:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 314. [2021-11-06 02:09:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 308 states have (on average 1.2824675324675325) internal successors, (395), 313 states have internal predecessors, (395), 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 02:09:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 395 transitions. [2021-11-06 02:09:44,126 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 395 transitions. Word has length 71 [2021-11-06 02:09:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:44,127 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 395 transitions. [2021-11-06 02:09:44,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 02:09:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 395 transitions. [2021-11-06 02:09:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 02:09:44,128 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:44,128 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 02:09:44,145 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 02:09:44,343 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 02:09:44,343 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2000986198, now seen corresponding path program 1 times [2021-11-06 02:09:44,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:44,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627139360] [2021-11-06 02:09:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:44,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:44,355 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 02:09:44,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753310128] [2021-11-06 02:09:44,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:44,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 02:09:44,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:44,357 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 02:09:44,388 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 02:09:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:44,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:09:44,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:09:44,611 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 02:09:44,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 02:09:44,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:44,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627139360] [2021-11-06 02:09:44,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 02:09:44,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753310128] [2021-11-06 02:09:44,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753310128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:44,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:44,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 02:09:44,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988447665] [2021-11-06 02:09:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:44,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 02:09:44,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 02:09:44,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 02:09:44,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 02:09:44,614 INFO L87 Difference]: Start difference. First operand 314 states and 395 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 02:09:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:44,663 INFO L93 Difference]: Finished difference Result 525 states and 681 transitions. [2021-11-06 02:09:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 02:09:44,664 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 02:09:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:44,665 INFO L225 Difference]: With dead ends: 525 [2021-11-06 02:09:44,665 INFO L226 Difference]: Without dead ends: 356 [2021-11-06 02:09:44,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.51ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 02:09:44,666 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.67ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.91ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:44,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 449 Invalid, 72 Unknown, 0 Unchecked, 0.67ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 42.91ms Time] [2021-11-06 02:09:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-11-06 02:09:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2021-11-06 02:09:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 348 states have (on average 1.25) internal successors, (435), 353 states have internal predecessors, (435), 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 02:09:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 435 transitions. [2021-11-06 02:09:44,672 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 435 transitions. Word has length 103 [2021-11-06 02:09:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:44,673 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 435 transitions. [2021-11-06 02:09:44,673 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 02:09:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 435 transitions. [2021-11-06 02:09:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 02:09:44,674 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:44,674 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 02:09:44,693 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 02:09:44,889 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 02:09:44,890 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1973776046, now seen corresponding path program 1 times [2021-11-06 02:09:44,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:44,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61223313] [2021-11-06 02:09:44,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:44,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:44,900 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 02:09:44,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582793661] [2021-11-06 02:09:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:44,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 02:09:44,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:44,902 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 02:09:44,903 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 02:09:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:45,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:09:45,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:09:45,199 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 02:09:45,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 02:09:45,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:45,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61223313] [2021-11-06 02:09:45,200 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 02:09:45,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582793661] [2021-11-06 02:09:45,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582793661] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:45,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:45,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 02:09:45,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616586516] [2021-11-06 02:09:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:45,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 02:09:45,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 02:09:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 02:09:45,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 02:09:45,202 INFO L87 Difference]: Start difference. First operand 354 states and 435 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 02:09:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:45,245 INFO L93 Difference]: Finished difference Result 540 states and 676 transitions. [2021-11-06 02:09:45,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 02:09:45,245 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 02:09:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:45,246 INFO L225 Difference]: With dead ends: 540 [2021-11-06 02:09:45,246 INFO L226 Difference]: Without dead ends: 331 [2021-11-06 02:09:45,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.61ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:09:45,247 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 130 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.89ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.24ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:45,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 564 Invalid, 66 Unknown, 0 Unchecked, 0.89ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 32.24ms Time] [2021-11-06 02:09:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-11-06 02:09:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2021-11-06 02:09:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 320 states have (on average 1.228125) internal successors, (393), 325 states have internal predecessors, (393), 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 02:09:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 393 transitions. [2021-11-06 02:09:45,253 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 393 transitions. Word has length 103 [2021-11-06 02:09:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:45,254 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 393 transitions. [2021-11-06 02:09:45,254 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 02:09:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 393 transitions. [2021-11-06 02:09:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 02:09:45,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:45,255 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 02:09:45,272 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 02:09:45,472 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 02:09:45,473 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:45,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1090927200, now seen corresponding path program 1 times [2021-11-06 02:09:45,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:45,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407010471] [2021-11-06 02:09:45,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:45,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:45,483 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 02:09:45,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1871350946] [2021-11-06 02:09:45,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:45,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 02:09:45,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:45,484 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 02:09:45,485 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 02:09:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:45,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 02:09:45,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:09:45,798 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 02:09:45,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 02:09:45,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:45,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407010471] [2021-11-06 02:09:45,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 02:09:45,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871350946] [2021-11-06 02:09:45,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871350946] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:45,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:45,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 02:09:45,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676956946] [2021-11-06 02:09:45,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:45,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 02:09:45,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 02:09:45,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 02:09:45,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 02:09:45,801 INFO L87 Difference]: Start difference. First operand 326 states and 393 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 02:09:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:45,984 INFO L93 Difference]: Finished difference Result 740 states and 900 transitions. [2021-11-06 02:09:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 02:09:45,985 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 02:09:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:45,987 INFO L225 Difference]: With dead ends: 740 [2021-11-06 02:09:45,987 INFO L226 Difference]: Without dead ends: 462 [2021-11-06 02:09:45,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.55ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:09:45,988 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 497 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 123.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.83ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 164.30ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:45,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 498 Invalid, 82 Unknown, 0 Unchecked, 1.83ms Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 164.30ms Time] [2021-11-06 02:09:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-11-06 02:09:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 410. [2021-11-06 02:09:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 404 states have (on average 1.2301980198019802) internal successors, (497), 409 states have internal predecessors, (497), 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 02:09:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 497 transitions. [2021-11-06 02:09:45,997 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 497 transitions. Word has length 103 [2021-11-06 02:09:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:45,997 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 497 transitions. [2021-11-06 02:09:45,997 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 02:09:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 497 transitions. [2021-11-06 02:09:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-06 02:09:45,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:45,998 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 02:09:46,024 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 02:09:46,211 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 02:09:46,211 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 541561274, now seen corresponding path program 1 times [2021-11-06 02:09:46,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 02:09:46,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242557115] [2021-11-06 02:09:46,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:46,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 02:09:46,223 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 02:09:46,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303664844] [2021-11-06 02:09:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:46,224 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 02:09:46,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:46,225 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 02:09:46,226 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 02:09:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:46,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-06 02:09:46,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:09:46,363 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 02:09:46,381 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 02:09:46,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:46,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:46,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:46,418 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 02:09:47,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,104 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 02:09:47,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,110 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 37 treesize of output 42 [2021-11-06 02:09:47,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,162 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 02:09:47,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:47,200 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 02:09:47,207 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 13 treesize of output 9 [2021-11-06 02:09:47,213 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 27 treesize of output 23 [2021-11-06 02:09:47,219 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-11-06 02:09:47,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-11-06 02:09:48,420 INFO L354 Elim1Store]: treesize reduction 364, result has 11.9 percent of original size [2021-11-06 02:09:48,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 2832 treesize of output 2281 [2021-11-06 02:09:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:48,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:48,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:48,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 02:09:52,456 INFO L354 Elim1Store]: treesize reduction 7776, result has 3.0 percent of original size [2021-11-06 02:09:52,456 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 3301 treesize of output 1804 [2021-11-06 02:09:52,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 02:09:52,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242557115] [2021-11-06 02:09:52,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 02:09:52,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303664844] [2021-11-06 02:09:52,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-06 02:09:52,536 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:52,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 02:09:52,536 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-06 02:09:52,537 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 02:09:52,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-06 02:09:52,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-06 02:09:52,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-11-06 02:09:52,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-11-06 02:09:52,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-11-06 02:09:52,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-06 02:09:52,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-06 02:09:52,767 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 02:09:52,769 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 02:09:52,771 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 02:09:52,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 02:09:52 BoogieIcfgContainer [2021-11-06 02:09:52,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 02:09:52,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 02:09:52,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 02:09:52,792 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 02:09:52,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:09:41" (3/4) ... [2021-11-06 02:09:52,794 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 02:09:52,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 02:09:52,794 INFO L158 Benchmark]: Toolchain (without parser) took 13254.47ms. Allocated memory was 58.7MB in the beginning and 144.7MB in the end (delta: 86.0MB). Free memory was 35.6MB in the beginning and 100.2MB in the end (delta: -64.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2021-11-06 02:09:52,794 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 58.7MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 02:09:52,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.23ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 35.4MB in the beginning and 54.4MB in the end (delta: -19.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2021-11-06 02:09:52,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.40ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 47.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-06 02:09:52,795 INFO L158 Benchmark]: Boogie Preprocessor took 54.29ms. Allocated memory is still 77.6MB. Free memory was 47.6MB in the beginning and 40.5MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-06 02:09:52,795 INFO L158 Benchmark]: RCFGBuilder took 801.59ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 40.2MB in the beginning and 45.5MB in the end (delta: -5.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2021-11-06 02:09:52,795 INFO L158 Benchmark]: TraceAbstraction took 11738.55ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 45.1MB in the beginning and 100.2MB in the end (delta: -55.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2021-11-06 02:09:52,796 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 144.7MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 02:09:52,797 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.13ms. Allocated memory is still 58.7MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.23ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 35.4MB in the beginning and 54.4MB in the end (delta: -19.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.40ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 47.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.29ms. Allocated memory is still 77.6MB. Free memory was 47.6MB in the beginning and 40.5MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 801.59ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 40.2MB in the beginning and 45.5MB in the end (delta: -5.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11738.55ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 45.1MB in the beginning and 100.2MB in the end (delta: -55.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 144.7MB. Free memory is still 100.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: 750]: 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 745, overapproximation of bitwiseAnd at line 745. Possible FailurePath: [L706] int count_int_int = 0; [L733] int i; [L734] example_user_t *user, *tmp, *users=((void *)0); [L735] i=0 [L735] EXPR \read(i) [L735] COND TRUE i<10 [L736] user = (example_user_t*)malloc(sizeof(example_user_t)) [L737] COND FALSE !(user == ((void *)0)) [L740] EXPR \read(i) [L740] user->id = i [L741] EXPR \read(i) [L741] EXPR \read(i) [L741] user->cookie = i*i [L742] unsigned _ha_hashv; [L742] unsigned _hj_i,_hj_j,_hj_k; [L742] unsigned const char *_hj_key=(unsigned const char*)(&((user)->id)); [L742] _ha_hashv = 0xfeedbeefu [L742] EXPR _hj_j = 0x9e3779b9u [L742] _hj_i = _hj_j = 0x9e3779b9u [L742] _hj_k = (unsigned)(sizeof(int)) [L742] COND FALSE !(_hj_k >= 12U) [L742] _ha_hashv += (unsigned)(sizeof(int)) [L742] case 11: [L742] case 10: [L742] case 9: [L742] case 8: [L742] case 7: [L742] case 6: [L742] case 5: [L742] case 4: [L742] EXPR _hj_key[3] [L742] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L742] case 3: [L742] EXPR _hj_key[2] [L742] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L742] case 2: [L742] EXPR _hj_key[1] [L742] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L742] case 1: [L742] EXPR _hj_key[0] [L742] _hj_i += _hj_key[0] [L742] _hj_i -= _hj_j [L742] _hj_i -= _ha_hashv [L742] _hj_i ^= ( _ha_hashv >> 13 ) [L742] _hj_j -= _ha_hashv [L742] _hj_j -= _hj_i [L742] _hj_j ^= ( _hj_i << 8 ) [L742] _ha_hashv -= _hj_i [L742] _ha_hashv -= _hj_j [L742] _ha_hashv ^= ( _hj_j >> 13 ) [L742] _hj_i -= _hj_j [L742] _hj_i -= _ha_hashv [L742] _hj_i ^= ( _ha_hashv >> 12 ) [L742] _hj_j -= _ha_hashv [L742] _hj_j -= _hj_i [L742] _hj_j ^= ( _hj_i << 16 ) [L742] _ha_hashv -= _hj_i [L742] _ha_hashv -= _hj_j [L742] _ha_hashv ^= ( _hj_j >> 5 ) [L742] _hj_i -= _hj_j [L742] _hj_i -= _ha_hashv [L742] _hj_i ^= ( _ha_hashv >> 3 ) [L742] _hj_j -= _ha_hashv [L742] _hj_j -= _hj_i [L742] _hj_j ^= ( _hj_i << 10 ) [L742] _ha_hashv -= _hj_i [L742] _ha_hashv -= _hj_j [L742] _ha_hashv ^= ( _hj_j >> 15 ) [L742] (user)->hh.hashv = (_ha_hashv) [L742] (user)->hh.key = (char*) (&((user)->id)) [L742] (user)->hh.keylen = (unsigned) (sizeof(int)) [L742] COND TRUE !(users) [L742] (user)->hh.next = ((void *)0) [L742] (user)->hh.prev = ((void *)0) [L742] (user)->hh.tbl = (UT_hash_table*)malloc(sizeof(UT_hash_table)) [L742] EXPR (user)->hh.tbl [L742] COND FALSE !(!(user)->hh.tbl) [L742] (user)->hh.tbl [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->tail = &((user)->hh) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->num_buckets = 32U [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->log2_num_buckets = 5U [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->hho = (char*)(&(user)->hh) - (char*)(user) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->buckets = (UT_hash_bucket*)malloc(32U * sizeof(struct UT_hash_bucket)) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->signature = 0xa0111fe1u [L742] EXPR (user)->hh.tbl [L742] EXPR (user)->hh.tbl->buckets [L742] COND FALSE !(!(user)->hh.tbl->buckets) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->buckets [L742] (users) = (user) [L742] unsigned _ha_bkt; [L742] EXPR (users)->hh.tbl [L742] EXPR (users)->hh.tbl->num_items [L742] (users)->hh.tbl->num_items++ [L742] EXPR (users)->hh.tbl [L742] EXPR (users)->hh.tbl->num_buckets [L742] _ha_bkt = ((_ha_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L742] EXPR (users)->hh.tbl [L742] EXPR (users)->hh.tbl->buckets [L742] UT_hash_bucket *_ha_head = &((users)->hh.tbl->buckets[_ha_bkt]); [L742] EXPR _ha_head->count [L742] _ha_head->count++ [L742] EXPR _ha_head->hh_head [L742] (&(user)->hh)->hh_next = _ha_head->hh_head [L742] (&(user)->hh)->hh_prev = ((void *)0) [L742] EXPR _ha_head->hh_head [L742] COND FALSE !(_ha_head->hh_head != ((void *)0)) [L742] _ha_head->hh_head = (&(user)->hh) [L742] EXPR _ha_head->count [L742] EXPR _ha_head->expand_mult [L742] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L742] EXPR (&(user)->hh)->tbl [L742] EXPR (&(user)->hh)->tbl->noexpand [L742] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L742] COND FALSE !((_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand) [L735] EXPR \read(i) [L735] i++ [L735] EXPR \read(i) [L735] COND FALSE !(i<10) [L744] i=0 [L744] EXPR \read(i) [L744] COND TRUE i<10 [L745] unsigned _hf_hashv; [L745] unsigned _hj_i,_hj_j,_hj_k; [L745] unsigned const char *_hj_key=(unsigned const char*)(&i); [L745] _hf_hashv = 0xfeedbeefu [L745] EXPR _hj_j = 0x9e3779b9u [L745] _hj_i = _hj_j = 0x9e3779b9u [L745] _hj_k = (unsigned)(sizeof(int)) [L745] COND FALSE !(_hj_k >= 12U) [L745] _hf_hashv += (unsigned)(sizeof(int)) [L745] case 11: [L745] case 10: [L745] case 9: [L745] case 8: [L745] case 7: [L745] case 6: [L745] case 5: [L745] case 4: [L745] EXPR _hj_key[3] [L745] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L745] case 3: [L745] EXPR _hj_key[2] [L745] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L745] case 2: [L745] EXPR _hj_key[1] [L745] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L745] case 1: [L745] EXPR _hj_key[0] [L745] _hj_i += _hj_key[0] [L745] _hj_i -= _hj_j [L745] _hj_i -= _hf_hashv [L745] _hj_i ^= ( _hf_hashv >> 13 ) [L745] _hj_j -= _hf_hashv [L745] _hj_j -= _hj_i [L745] _hj_j ^= ( _hj_i << 8 ) [L745] _hf_hashv -= _hj_i [L745] _hf_hashv -= _hj_j [L745] _hf_hashv ^= ( _hj_j >> 13 ) [L745] _hj_i -= _hj_j [L745] _hj_i -= _hf_hashv [L745] _hj_i ^= ( _hf_hashv >> 12 ) [L745] _hj_j -= _hf_hashv [L745] _hj_j -= _hj_i [L745] _hj_j ^= ( _hj_i << 16 ) [L745] _hf_hashv -= _hj_i [L745] _hf_hashv -= _hj_j [L745] _hf_hashv ^= ( _hj_j >> 5 ) [L745] _hj_i -= _hj_j [L745] _hj_i -= _hf_hashv [L745] _hj_i ^= ( _hf_hashv >> 3 ) [L745] _hj_j -= _hf_hashv [L745] _hj_j -= _hj_i [L745] _hj_j ^= ( _hj_i << 10 ) [L745] _hf_hashv -= _hj_i [L745] _hf_hashv -= _hj_j [L745] _hf_hashv ^= ( _hj_j >> 15 ) [L745] (tmp) = ((void *)0) [L745] COND TRUE \read(*users) [L745] unsigned _hf_bkt; [L745] EXPR (users)->hh.tbl [L745] EXPR (users)->hh.tbl->num_buckets [L745] _hf_bkt = ((_hf_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L745] EXPR (users)->hh.tbl [L745] EXPR (users)->hh.tbl->buckets [L745] EXPR ((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head [L745] COND FALSE !(((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head != ((void *)0)) [L745] (tmp) = ((void *)0) [L745] COND FALSE !((tmp) != ((void *)0)) [L746] COND FALSE !(tmp != ((void *)0)) [L750] reach_error() - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: 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, 202 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11676.21ms, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 20.87ms, AutomataDifference: 1068.55ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 12.63ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1332 SdHoareTripleChecker+Valid, 837.60ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1332 mSDsluCounter, 4541 SdHoareTripleChecker+Invalid, 659.80ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2278 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 569 IncrementalHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 2263 mSDtfsCounter, 569 mSolverCounterSat, 16.02ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.93ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=9, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 89.55ms AutomataMinimizationTime, 9 MinimizatonAttempts, 313 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 342.91ms SsaConstructionTime, 354.21ms SatisfiabilityAnalysisTime, 7366.27ms InterpolantComputationTime, 703 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2355 ConjunctsInSsa, 76 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 02:09:52,839 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_SFH_test3-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 f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 02:09:54,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 02:09:54,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 02:09:54,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 02:09:54,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 02:09:54,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 02:09:54,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 02:09:54,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 02:09:54,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 02:09:54,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 02:09:54,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 02:09:54,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 02:09:54,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 02:09:54,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 02:09:54,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 02:09:54,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 02:09:54,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 02:09:54,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 02:09:54,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 02:09:54,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 02:09:54,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 02:09:54,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 02:09:54,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 02:09:54,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 02:09:54,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 02:09:54,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 02:09:54,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 02:09:54,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 02:09:54,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 02:09:54,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 02:09:54,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 02:09:54,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 02:09:54,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 02:09:54,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 02:09:54,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 02:09:54,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 02:09:54,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 02:09:54,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 02:09:54,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 02:09:54,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 02:09:54,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 02:09:54,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-06 02:09:54,601 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 02:09:54,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 02:09:54,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 02:09:54,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 02:09:54,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 02:09:54,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 02:09:54,605 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 02:09:54,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 02:09:54,605 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 02:09:54,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 02:09:54,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 02:09:54,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 02:09:54,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 02:09:54,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 02:09:54,606 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 02:09:54,607 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 02:09:54,607 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 02:09:54,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 02:09:54,607 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 02:09:54,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 02:09:54,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 02:09:54,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 02:09:54,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 02:09:54,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 02:09:54,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 02:09:54,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 02:09:54,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 02:09:54,614 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 02:09:54,614 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 02:09:54,614 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 02:09:54,614 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 02:09:54,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 02:09:54,614 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 02:09:54,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 02:09:54,615 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 -> f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 [2021-11-06 02:09:54,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 02:09:54,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 02:09:54,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 02:09:54,868 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 02:09:54,868 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 02:09:54,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2021-11-06 02:09:54,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8ca00ed/483c818de8bd44aea26545274c347ae9/FLAGd6412d940 [2021-11-06 02:09:55,352 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 02:09:55,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2021-11-06 02:09:55,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8ca00ed/483c818de8bd44aea26545274c347ae9/FLAGd6412d940 [2021-11-06 02:09:55,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8ca00ed/483c818de8bd44aea26545274c347ae9 [2021-11-06 02:09:55,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 02:09:55,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 02:09:55,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 02:09:55,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 02:09:55,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 02:09:55,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:55,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e208f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55, skipping insertion in model container [2021-11-06 02:09:55,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:55,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 02:09:55,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 02:09:55,724 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_SFH_test3-1.i[33021,33034] [2021-11-06 02:09:55,817 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_SFH_test3-1.i[44590,44603] [2021-11-06 02:09:55,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 02:09:55,839 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 02:09:55,853 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_SFH_test3-1.i[33021,33034] [2021-11-06 02:09:55,903 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_SFH_test3-1.i[44590,44603] [2021-11-06 02:09:55,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 02:09:55,934 INFO L208 MainTranslator]: Completed translation [2021-11-06 02:09:55,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55 WrapperNode [2021-11-06 02:09:55,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 02:09:55,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 02:09:55,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 02:09:55,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 02:09:55,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:55,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:56,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 02:09:56,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 02:09:56,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 02:09:56,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 02:09:56,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:56,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:56,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:56,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:56,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:56,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:56,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:56,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 02:09:56,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 02:09:56,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 02:09:56,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 02:09:56,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (1/1) ... [2021-11-06 02:09:56,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 02:09:56,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 02:09:56,133 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 02:09:56,153 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 02:09:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 02:09:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 02:09:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 02:09:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 02:09:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 02:09:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 02:09:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 02:09:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 02:09:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 02:09:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 02:09:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 02:09:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 02:09:59,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 02:09:59,186 INFO L299 CfgBuilder]: Removed 85 assume(true) statements. [2021-11-06 02:09:59,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:09:59 BoogieIcfgContainer [2021-11-06 02:09:59,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 02:09:59,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 02:09:59,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 02:09:59,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 02:09:59,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 02:09:55" (1/3) ... [2021-11-06 02:09:59,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47abaf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:09:59, skipping insertion in model container [2021-11-06 02:09:59,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:09:55" (2/3) ... [2021-11-06 02:09:59,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47abaf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:09:59, skipping insertion in model container [2021-11-06 02:09:59,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:09:59" (3/3) ... [2021-11-06 02:09:59,193 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-1.i [2021-11-06 02:09:59,196 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 02:09:59,196 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-06 02:09:59,221 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 02:09:59,224 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 02:09:59,227 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-06 02:09:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 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 02:09:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-06 02:09:59,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:59,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 02:09:59,250 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash 239232295, now seen corresponding path program 1 times [2021-11-06 02:09:59,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:09:59,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007550870] [2021-11-06 02:09:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:59,265 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:09:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:09:59,269 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 02:09:59,270 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 02:09:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:09:59,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-06 02:09:59,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:09:59,462 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 02:09:59,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:09:59,488 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 02:09:59,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:09:59,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007550870] [2021-11-06 02:09:59,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007550870] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 02:09:59,489 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:09:59,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 02:09:59,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183680555] [2021-11-06 02:09:59,501 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 02:09:59,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 02:09:59,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:09:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 02:09:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 02:09:59,538 INFO L87 Difference]: Start difference. First operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 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.5) internal successors, (9), 2 states have internal predecessors, (9), 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 02:09:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:09:59,567 INFO L93 Difference]: Finished difference Result 402 states and 670 transitions. [2021-11-06 02:09:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 02:09:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2021-11-06 02:09:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:09:59,576 INFO L225 Difference]: With dead ends: 402 [2021-11-06 02:09:59,577 INFO L226 Difference]: Without dead ends: 198 [2021-11-06 02:09:59,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 02:09:59,581 INFO L933 BasicCegarLoop]: 263 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, 263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.42ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 02:09:59,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 2.42ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 02:09:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-06 02:09:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-06 02:09:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 197 states have internal predecessors, (259), 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 02:09:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2021-11-06 02:09:59,618 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 9 [2021-11-06 02:09:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:09:59,619 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2021-11-06 02:09:59,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 02:09:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2021-11-06 02:09:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 02:09:59,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:09:59,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 02:09:59,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-06 02:09:59,828 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 02:09:59,828 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:09:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:09:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1042319138, now seen corresponding path program 1 times [2021-11-06 02:09:59,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:09:59,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283927798] [2021-11-06 02:09:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:09:59,834 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:09:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:09:59,838 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 02:09:59,840 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 02:10:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:10:00,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:10:00,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:00,049 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 02:10:00,077 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 02:10:00,112 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 02:10:00,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:00,172 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 02:10:00,173 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:00,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283927798] [2021-11-06 02:10:00,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283927798] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 02:10:00,176 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:10:00,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 02:10:00,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390137178] [2021-11-06 02:10:00,176 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 02:10:00,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 02:10:00,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 02:10:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 02:10:00,181 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 02:10:02,328 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 02:10:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:02,945 INFO L93 Difference]: Finished difference Result 552 states and 722 transitions. [2021-11-06 02:10:02,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 02:10:02,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 12 [2021-11-06 02:10:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:02,948 INFO L225 Difference]: With dead ends: 552 [2021-11-06 02:10:02,948 INFO L226 Difference]: Without dead ends: 444 [2021-11-06 02:10:02,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.78ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 02:10:02,949 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 477 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2561.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.00ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2719.29ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:02,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 756 Invalid, 210 Unknown, 0 Unchecked, 6.00ms Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 2719.29ms Time] [2021-11-06 02:10:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-06 02:10:02,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 200. [2021-11-06 02:10:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 199 states have internal predecessors, (261), 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 02:10:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 261 transitions. [2021-11-06 02:10:02,965 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 261 transitions. Word has length 12 [2021-11-06 02:10:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:02,966 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 261 transitions. [2021-11-06 02:10:02,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 02:10:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 261 transitions. [2021-11-06 02:10:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 02:10:02,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:02,967 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] [2021-11-06 02:10:02,987 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 02:10:03,175 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 02:10:03,176 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:03,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash 168111628, now seen corresponding path program 1 times [2021-11-06 02:10:03,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:03,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643333004] [2021-11-06 02:10:03,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:10:03,178 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:03,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:03,178 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 02:10:03,187 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 02:10:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:10:03,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:10:03,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:03,450 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 02:10:03,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:03,565 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 02:10:03,565 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:03,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643333004] [2021-11-06 02:10:03,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643333004] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 02:10:03,566 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:10:03,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 02:10:03,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251064540] [2021-11-06 02:10:03,566 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 02:10:03,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 02:10:03,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:03,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 02:10:03,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:10:03,567 INFO L87 Difference]: Start difference. First operand 200 states and 261 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 02:10:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:03,635 INFO L93 Difference]: Finished difference Result 405 states and 530 transitions. [2021-11-06 02:10:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 02:10:03,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 64 [2021-11-06 02:10:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:03,636 INFO L225 Difference]: With dead ends: 405 [2021-11-06 02:10:03,637 INFO L226 Difference]: Without dead ends: 209 [2021-11-06 02:10:03,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.70ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 02:10:03,638 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 244 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.11ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.76ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:03,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 477 Invalid, 69 Unknown, 0 Unchecked, 1.11ms Time], IncrementalHoareTripleChecker [30 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 55.76ms Time] [2021-11-06 02:10:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-06 02:10:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2021-11-06 02:10:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 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 02:10:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 256 transitions. [2021-11-06 02:10:03,646 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 256 transitions. Word has length 64 [2021-11-06 02:10:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:03,646 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 256 transitions. [2021-11-06 02:10:03,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 02:10:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 256 transitions. [2021-11-06 02:10:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 02:10:03,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:03,648 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] [2021-11-06 02:10:03,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-06 02:10:03,857 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 02:10:03,858 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:03,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1012352744, now seen corresponding path program 1 times [2021-11-06 02:10:03,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:03,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693951916] [2021-11-06 02:10:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:10:03,860 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:03,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:03,861 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 02:10:03,862 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 02:10:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:10:04,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:10:04,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:04,274 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 02:10:04,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:04,519 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 02:10:04,520 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:04,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693951916] [2021-11-06 02:10:04,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693951916] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 02:10:04,524 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:10:04,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 02:10:04,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139407508] [2021-11-06 02:10:04,524 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 02:10:04,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 02:10:04,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:04,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 02:10:04,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 02:10:04,526 INFO L87 Difference]: Start difference. First operand 203 states and 256 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 02:10:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:05,251 INFO L93 Difference]: Finished difference Result 533 states and 671 transitions. [2021-11-06 02:10:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 02:10:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2021-11-06 02:10:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:05,253 INFO L225 Difference]: With dead ends: 533 [2021-11-06 02:10:05,253 INFO L226 Difference]: Without dead ends: 334 [2021-11-06 02:10:05,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.53ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 02:10:05,254 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 686.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.23ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 715.10ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:05,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 532 Invalid, 36 Unknown, 0 Unchecked, 1.23ms Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 715.10ms Time] [2021-11-06 02:10:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-06 02:10:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 306. [2021-11-06 02:10:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 300 states have (on average 1.2833333333333334) internal successors, (385), 305 states have internal predecessors, (385), 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 02:10:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 385 transitions. [2021-11-06 02:10:05,263 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 385 transitions. Word has length 64 [2021-11-06 02:10:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:05,264 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 385 transitions. [2021-11-06 02:10:05,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 02:10:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 385 transitions. [2021-11-06 02:10:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 02:10:05,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:05,265 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] [2021-11-06 02:10:05,281 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 02:10:05,475 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 02:10:05,475 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash -147792665, now seen corresponding path program 1 times [2021-11-06 02:10:05,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:05,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036555376] [2021-11-06 02:10:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:10:05,477 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:05,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:05,482 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 02:10:05,484 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 02:10:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:10:05,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:10:05,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:05,763 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 02:10:05,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:05,866 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 02:10:05,866 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:05,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036555376] [2021-11-06 02:10:05,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036555376] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 02:10:05,867 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:10:05,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 02:10:05,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916752715] [2021-11-06 02:10:05,867 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 02:10:05,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 02:10:05,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:05,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 02:10:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 02:10:05,869 INFO L87 Difference]: Start difference. First operand 306 states and 385 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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 02:10:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:05,916 INFO L93 Difference]: Finished difference Result 570 states and 727 transitions. [2021-11-06 02:10:05,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 02:10:05,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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 71 [2021-11-06 02:10:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:05,918 INFO L225 Difference]: With dead ends: 570 [2021-11-06 02:10:05,918 INFO L226 Difference]: Without dead ends: 309 [2021-11-06 02:10:05,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.59ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 02:10:05,919 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.80ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.64ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:05,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 724 Invalid, 20 Unknown, 0 Unchecked, 0.80ms Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 39.64ms Time] [2021-11-06 02:10:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-11-06 02:10:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-11-06 02:10:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 303 states have (on average 1.2805280528052805) internal successors, (388), 308 states have internal predecessors, (388), 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 02:10:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 388 transitions. [2021-11-06 02:10:05,929 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 388 transitions. Word has length 71 [2021-11-06 02:10:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:05,930 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 388 transitions. [2021-11-06 02:10:05,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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 02:10:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 388 transitions. [2021-11-06 02:10:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 02:10:05,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:05,936 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, 1, 1] [2021-11-06 02:10:05,957 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 02:10:06,146 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 02:10:06,147 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:06,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1065048653, now seen corresponding path program 1 times [2021-11-06 02:10:06,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:06,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724334052] [2021-11-06 02:10:06,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:10:06,149 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:06,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:06,149 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 02:10:06,151 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 02:10:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:10:06,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 02:10:06,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:06,462 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 02:10:06,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:06,603 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 02:10:06,603 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:06,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724334052] [2021-11-06 02:10:06,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724334052] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 02:10:06,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 02:10:06,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-06 02:10:06,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948838346] [2021-11-06 02:10:06,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 02:10:06,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 02:10:06,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 02:10:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 02:10:06,605 INFO L87 Difference]: Start difference. First operand 309 states and 388 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 02:10:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:06,869 INFO L93 Difference]: Finished difference Result 579 states and 739 transitions. [2021-11-06 02:10:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 02:10:06,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 74 [2021-11-06 02:10:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:06,870 INFO L225 Difference]: With dead ends: 579 [2021-11-06 02:10:06,871 INFO L226 Difference]: Without dead ends: 315 [2021-11-06 02:10:06,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 136.02ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-06 02:10:06,872 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 137.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.41ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 167.76ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:06,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 963 Invalid, 50 Unknown, 0 Unchecked, 1.41ms Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 167.76ms Time] [2021-11-06 02:10:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-06 02:10:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-11-06 02:10:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 309 states have (on average 1.2750809061488673) internal successors, (394), 314 states have internal predecessors, (394), 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 02:10:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2021-11-06 02:10:06,879 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 74 [2021-11-06 02:10:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:06,879 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2021-11-06 02:10:06,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 02:10:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2021-11-06 02:10:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 02:10:06,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:06,880 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] [2021-11-06 02:10:06,905 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 02:10:07,090 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 02:10:07,090 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:07,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1820271245, now seen corresponding path program 2 times [2021-11-06 02:10:07,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:07,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291526082] [2021-11-06 02:10:07,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 02:10:07,091 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:07,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:07,093 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 02:10:07,094 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 02:10:07,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 02:10:07,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 02:10:07,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:10:07,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:07,294 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 02:10:07,307 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 02:10:07,326 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 02:10:07,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:07,422 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 02:10:07,422 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:07,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291526082] [2021-11-06 02:10:07,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291526082] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 02:10:07,422 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:10:07,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 02:10:07,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462098003] [2021-11-06 02:10:07,423 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 02:10:07,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 02:10:07,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 02:10:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 02:10:07,424 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 02:10:09,525 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 02:10:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:11,028 INFO L93 Difference]: Finished difference Result 490 states and 625 transitions. [2021-11-06 02:10:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 02:10:11,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 80 [2021-11-06 02:10:11,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:11,031 INFO L225 Difference]: With dead ends: 490 [2021-11-06 02:10:11,031 INFO L226 Difference]: Without dead ends: 465 [2021-11-06 02:10:11,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.75ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 02:10:11,032 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 207 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3353.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.51ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3557.60ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:11,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 830 Invalid, 238 Unknown, 0 Unchecked, 4.51ms Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 3557.60ms Time] [2021-11-06 02:10:11,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-11-06 02:10:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 386. [2021-11-06 02:10:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 385 states have internal predecessors, (490), 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 02:10:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 490 transitions. [2021-11-06 02:10:11,043 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 490 transitions. Word has length 80 [2021-11-06 02:10:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:11,051 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 490 transitions. [2021-11-06 02:10:11,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 02:10:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 490 transitions. [2021-11-06 02:10:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 02:10:11,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:11,053 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 02:10:11,060 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 02:10:11,260 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 02:10:11,261 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1224331210, now seen corresponding path program 1 times [2021-11-06 02:10:11,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:11,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335275645] [2021-11-06 02:10:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:10:11,262 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:11,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:11,264 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 02:10:11,266 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 02:10:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:10:11,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 02:10:11,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:11,726 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 02:10:11,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:12,190 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 02:10:12,190 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:12,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335275645] [2021-11-06 02:10:12,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335275645] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 02:10:12,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 02:10:12,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-06 02:10:12,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973358068] [2021-11-06 02:10:12,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 02:10:12,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 02:10:12,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:12,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 02:10:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-06 02:10:12,191 INFO L87 Difference]: Start difference. First operand 386 states and 490 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 02:10:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:13,666 INFO L93 Difference]: Finished difference Result 739 states and 955 transitions. [2021-11-06 02:10:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 02:10:13,667 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 02:10:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:13,669 INFO L225 Difference]: With dead ends: 739 [2021-11-06 02:10:13,670 INFO L226 Difference]: Without dead ends: 398 [2021-11-06 02:10:13,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 863.37ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-06 02:10:13,671 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 860.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.88ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 923.19ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:13,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1919 Invalid, 162 Unknown, 0 Unchecked, 2.88ms Time], IncrementalHoareTripleChecker [45 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 923.19ms Time] [2021-11-06 02:10:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-06 02:10:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-11-06 02:10:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 392 states have (on average 1.280612244897959) internal successors, (502), 397 states have internal predecessors, (502), 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 02:10:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 502 transitions. [2021-11-06 02:10:13,680 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 502 transitions. Word has length 112 [2021-11-06 02:10:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:13,682 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 502 transitions. [2021-11-06 02:10:13,682 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 02:10:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 502 transitions. [2021-11-06 02:10:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 02:10:13,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:13,683 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 02:10:13,694 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 02:10:13,893 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 02:10:13,894 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2016870474, now seen corresponding path program 2 times [2021-11-06 02:10:13,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:13,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998802355] [2021-11-06 02:10:13,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 02:10:13,895 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:13,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:13,897 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 02:10:13,898 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 02:10:14,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 02:10:14,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 02:10:14,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:10:14,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:14,236 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 02:10:14,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:14,387 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 02:10:14,388 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:14,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998802355] [2021-11-06 02:10:14,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998802355] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 02:10:14,388 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:10:14,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 02:10:14,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781090319] [2021-11-06 02:10:14,388 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 02:10:14,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 02:10:14,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 02:10:14,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:10:14,389 INFO L87 Difference]: Start difference. First operand 398 states and 502 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 02:10:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:14,498 INFO L93 Difference]: Finished difference Result 645 states and 838 transitions. [2021-11-06 02:10:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 02:10:14,499 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 02:10:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:14,500 INFO L225 Difference]: With dead ends: 645 [2021-11-06 02:10:14,500 INFO L226 Difference]: Without dead ends: 410 [2021-11-06 02:10:14,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.22ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 02:10:14,501 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 249 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.16ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.35ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:14,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 547 Invalid, 74 Unknown, 0 Unchecked, 1.16ms Time], IncrementalHoareTripleChecker [37 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 91.35ms Time] [2021-11-06 02:10:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-06 02:10:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2021-11-06 02:10:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 401 states have (on average 1.2144638403990025) internal successors, (487), 406 states have internal predecessors, (487), 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 02:10:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 487 transitions. [2021-11-06 02:10:14,510 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 487 transitions. Word has length 124 [2021-11-06 02:10:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:14,510 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 487 transitions. [2021-11-06 02:10:14,510 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 02:10:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 487 transitions. [2021-11-06 02:10:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 02:10:14,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:14,511 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 02:10:14,533 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 02:10:14,718 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 02:10:14,719 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1333208362, now seen corresponding path program 1 times [2021-11-06 02:10:14,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:14,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901310954] [2021-11-06 02:10:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:10:14,720 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:14,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:14,736 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 02:10:14,738 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 02:10:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:10:14,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 02:10:14,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:15,414 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 02:10:15,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:16,627 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 02:10:16,627 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:16,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901310954] [2021-11-06 02:10:16,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901310954] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 02:10:16,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 02:10:16,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-06 02:10:16,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959481871] [2021-11-06 02:10:16,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 02:10:16,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-06 02:10:16,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:16,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-06 02:10:16,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-11-06 02:10:16,628 INFO L87 Difference]: Start difference. First operand 407 states and 487 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 02:10:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:24,777 INFO L93 Difference]: Finished difference Result 793 states and 973 transitions. [2021-11-06 02:10:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 02:10:24,777 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 02:10:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:24,778 INFO L225 Difference]: With dead ends: 793 [2021-11-06 02:10:24,778 INFO L226 Difference]: Without dead ends: 431 [2021-11-06 02:10:24,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3560.30ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-11-06 02:10:24,780 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 3648 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5476.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3883 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.88ms SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5685.32ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:24,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3883 Invalid, 533 Unknown, 0 Unchecked, 4.88ms Time], IncrementalHoareTripleChecker [157 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 5685.32ms Time] [2021-11-06 02:10:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-06 02:10:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2021-11-06 02:10:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 425 states have (on average 1.2023529411764706) internal successors, (511), 430 states have internal predecessors, (511), 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 02:10:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 511 transitions. [2021-11-06 02:10:24,790 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 511 transitions. Word has length 124 [2021-11-06 02:10:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:24,790 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 511 transitions. [2021-11-06 02:10:24,790 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 02:10:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 511 transitions. [2021-11-06 02:10:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 02:10:24,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:24,791 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 02:10:24,803 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 02:10:25,002 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 02:10:25,003 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2039593942, now seen corresponding path program 2 times [2021-11-06 02:10:25,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:25,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602482267] [2021-11-06 02:10:25,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 02:10:25,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:25,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:25,008 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 02:10:25,010 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 02:10:25,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 02:10:25,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 02:10:25,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 02:10:25,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:25,377 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 02:10:25,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:25,604 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 02:10:25,605 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:25,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602482267] [2021-11-06 02:10:25,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602482267] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 02:10:25,605 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:10:25,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [] total 5 [2021-11-06 02:10:25,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464532602] [2021-11-06 02:10:25,605 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 02:10:25,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 02:10:25,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:25,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 02:10:25,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:10:25,606 INFO L87 Difference]: Start difference. First operand 431 states and 511 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 02:10:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:10:25,657 INFO L93 Difference]: Finished difference Result 653 states and 785 transitions. [2021-11-06 02:10:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 02:10:25,657 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 02:10:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:10:25,659 INFO L225 Difference]: With dead ends: 653 [2021-11-06 02:10:25,659 INFO L226 Difference]: Without dead ends: 434 [2021-11-06 02:10:25,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.29ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:10:25,660 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 3 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.52ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.74ms IncrementalHoareTripleChecker+Time [2021-11-06 02:10:25,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 647 Invalid, 64 Unknown, 0 Unchecked, 0.52ms Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 42.74ms Time] [2021-11-06 02:10:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-11-06 02:10:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2021-11-06 02:10:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 425 states have (on average 1.1811764705882353) internal successors, (502), 430 states have internal predecessors, (502), 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 02:10:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 502 transitions. [2021-11-06 02:10:25,675 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 502 transitions. Word has length 148 [2021-11-06 02:10:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:10:25,675 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 502 transitions. [2021-11-06 02:10:25,675 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 02:10:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 502 transitions. [2021-11-06 02:10:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 02:10:25,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:10:25,676 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 02:10:25,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-06 02:10:25,885 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 02:10:25,885 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:10:25,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:10:25,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1997207916, now seen corresponding path program 1 times [2021-11-06 02:10:25,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:10:25,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086545388] [2021-11-06 02:10:25,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:10:25,886 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:10:25,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:10:25,887 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 02:10:25,888 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 02:10:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:10:26,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-06 02:10:26,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:10:27,132 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 02:10:27,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:10:29,616 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 02:10:29,616 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:10:29,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086545388] [2021-11-06 02:10:29,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086545388] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 02:10:29,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 02:10:29,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2021-11-06 02:10:29,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813665348] [2021-11-06 02:10:29,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 02:10:29,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-06 02:10:29,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:10:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-06 02:10:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=3099, Unknown=0, NotChecked=0, Total=4032 [2021-11-06 02:10:29,619 INFO L87 Difference]: Start difference. First operand 431 states and 502 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 02:11:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:11:25,071 INFO L93 Difference]: Finished difference Result 847 states and 1015 transitions. [2021-11-06 02:11:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-06 02:11:25,072 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 02:11:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:11:25,073 INFO L225 Difference]: With dead ends: 847 [2021-11-06 02:11:25,073 INFO L226 Difference]: Without dead ends: 461 [2021-11-06 02:11:25,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 20929.13ms TimeCoverageRelationStatistics Valid=2700, Invalid=6042, Unknown=0, NotChecked=0, Total=8742 [2021-11-06 02:11:25,075 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 7980 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36672.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8215 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.93ms SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37223.37ms IncrementalHoareTripleChecker+Time [2021-11-06 02:11:25,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8215 Invalid, 1698 Unknown, 0 Unchecked, 8.93ms Time], IncrementalHoareTripleChecker [555 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 37223.37ms Time] [2021-11-06 02:11:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-06 02:11:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2021-11-06 02:11:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 455 states have (on average 1.1692307692307693) internal successors, (532), 460 states have internal predecessors, (532), 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 02:11:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 532 transitions. [2021-11-06 02:11:25,087 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 532 transitions. Word has length 148 [2021-11-06 02:11:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:11:25,087 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 532 transitions. [2021-11-06 02:11:25,087 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 02:11:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 532 transitions. [2021-11-06 02:11:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-06 02:11:25,088 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:11:25,089 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 02:11:25,103 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 02:11:25,301 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 02:11:25,302 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:11:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:11:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843980, now seen corresponding path program 2 times [2021-11-06 02:11:25,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:11:25,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339170726] [2021-11-06 02:11:25,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 02:11:25,303 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:11:25,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:11:25,304 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 02:11:25,306 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 02:11:25,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 02:11:25,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 02:11:25,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-06 02:11:25,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:11:26,848 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 02:11:26,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:11:29,728 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 02:11:29,729 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:11:29,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339170726] [2021-11-06 02:11:29,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339170726] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 02:11:29,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 02:11:29,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2021-11-06 02:11:29,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884671931] [2021-11-06 02:11:29,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 02:11:29,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-06 02:11:29,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:11:29,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-06 02:11:29,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2021-11-06 02:11:29,731 INFO L87 Difference]: Start difference. First operand 461 states and 532 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 02:12:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:12:41,749 INFO L93 Difference]: Finished difference Result 910 states and 1081 transitions. [2021-11-06 02:12:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-06 02:12:41,754 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 02:12:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:12:41,756 INFO L225 Difference]: With dead ends: 910 [2021-11-06 02:12:41,756 INFO L226 Difference]: Without dead ends: 494 [2021-11-06 02:12:41,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 28933.94ms TimeCoverageRelationStatistics Valid=3199, Invalid=6113, Unknown=0, NotChecked=0, Total=9312 [2021-11-06 02:12:41,759 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 7296 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45339.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7531 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.62ms SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46144.07ms IncrementalHoareTripleChecker+Time [2021-11-06 02:12:41,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7531 Invalid, 1930 Unknown, 0 Unchecked, 12.62ms Time], IncrementalHoareTripleChecker [591 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 46144.07ms Time] [2021-11-06 02:12:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-11-06 02:12:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2021-11-06 02:12:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 488 states have (on average 1.1577868852459017) internal successors, (565), 493 states have internal predecessors, (565), 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 02:12:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 565 transitions. [2021-11-06 02:12:41,778 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 565 transitions. Word has length 178 [2021-11-06 02:12:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:12:41,778 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 565 transitions. [2021-11-06 02:12:41,778 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 02:12:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 565 transitions. [2021-11-06 02:12:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-06 02:12:41,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:12:41,780 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 02:12:41,800 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 02:12:42,000 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 02:12:42,000 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:12:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:12:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1145284768, now seen corresponding path program 3 times [2021-11-06 02:12:42,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:12:42,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686600061] [2021-11-06 02:12:42,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 02:12:42,001 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:12:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:12:42,011 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 02:12:42,015 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 02:12:42,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-06 02:12:42,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 02:12:42,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 02:12:42,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:12:42,778 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 02:12:42,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:12:43,263 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 02:12:43,263 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:12:43,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686600061] [2021-11-06 02:12:43,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686600061] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 02:12:43,263 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 02:12:43,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 02:12:43,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156132032] [2021-11-06 02:12:43,264 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 02:12:43,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 02:12:43,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:12:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 02:12:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 02:12:43,264 INFO L87 Difference]: Start difference. First operand 494 states and 565 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 02:12:45,183 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 02:12:46,698 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 02:12:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:12:47,578 INFO L93 Difference]: Finished difference Result 1070 states and 1232 transitions. [2021-11-06 02:12:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 02:12:47,579 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 02:12:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:12:47,581 INFO L225 Difference]: With dead ends: 1070 [2021-11-06 02:12:47,581 INFO L226 Difference]: Without dead ends: 621 [2021-11-06 02:12:47,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.58ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 02:12:47,583 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 476 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4159.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.86ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4286.40ms IncrementalHoareTripleChecker+Time [2021-11-06 02:12:47,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 441 Invalid, 87 Unknown, 0 Unchecked, 0.86ms Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 4286.40ms Time] [2021-11-06 02:12:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-11-06 02:12:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 569. [2021-11-06 02:12:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 563 states have (on average 1.1580817051509769) internal successors, (652), 568 states have internal predecessors, (652), 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 02:12:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 652 transitions. [2021-11-06 02:12:47,609 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 652 transitions. Word has length 211 [2021-11-06 02:12:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:12:47,610 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 652 transitions. [2021-11-06 02:12:47,610 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 02:12:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 652 transitions. [2021-11-06 02:12:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-06 02:12:47,611 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:12:47,612 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 02:12:47,628 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 02:12:47,823 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 02:12:47,823 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:12:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:12:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash 670931834, now seen corresponding path program 1 times [2021-11-06 02:12:47,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:12:47,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022133450] [2021-11-06 02:12:47,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 02:12:47,825 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:12:47,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:12:47,826 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 02:12:47,830 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 02:12:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 02:12:48,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-06 02:12:48,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:12:51,203 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 02:12:51,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:13:01,833 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 02:13:01,834 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:13:01,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022133450] [2021-11-06 02:13:01,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022133450] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 02:13:01,834 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 02:13:01,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2021-11-06 02:13:01,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833264802] [2021-11-06 02:13:01,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 02:13:01,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-11-06 02:13:01,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:13:01,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-11-06 02:13:01,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4486, Invalid=12806, Unknown=0, NotChecked=0, Total=17292 [2021-11-06 02:13:01,838 INFO L87 Difference]: Start difference. First operand 569 states and 652 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 02:16:12,239 WARN L230 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 196 [2021-11-06 02:16:19,819 WARN L230 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 193 [2021-11-06 02:16:40,514 WARN L230 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 184 [2021-11-06 02:18:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 02:18:05,331 INFO L93 Difference]: Finished difference Result 1045 states and 1271 transitions. [2021-11-06 02:18:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-06 02:18:05,333 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 02:18:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 02:18:05,347 INFO L225 Difference]: With dead ends: 1045 [2021-11-06 02:18:05,348 INFO L226 Difference]: Without dead ends: 635 [2021-11-06 02:18:05,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 205613.18ms TimeCoverageRelationStatistics Valid=12934, Invalid=25286, Unknown=0, NotChecked=0, Total=38220 [2021-11-06 02:18:05,357 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 15276 mSDsCounter, 0 mSdLazyCounter, 4781 mSolverCounterSat, 1119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 107205.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15511 SdHoareTripleChecker+Invalid, 5900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.23ms SdHoareTripleChecker+Time, 1119 IncrementalHoareTripleChecker+Valid, 4781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 109627.59ms IncrementalHoareTripleChecker+Time [2021-11-06 02:18:05,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15511 Invalid, 5900 Unknown, 0 Unchecked, 27.23ms Time], IncrementalHoareTripleChecker [1119 Valid, 4781 Invalid, 0 Unknown, 0 Unchecked, 109627.59ms Time] [2021-11-06 02:18:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-11-06 02:18:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2021-11-06 02:18:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 629 states have (on average 1.1414944356120826) internal successors, (718), 634 states have internal predecessors, (718), 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 02:18:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 718 transitions. [2021-11-06 02:18:05,400 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 718 transitions. Word has length 218 [2021-11-06 02:18:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 02:18:05,401 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 718 transitions. [2021-11-06 02:18:05,401 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 02:18:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 718 transitions. [2021-11-06 02:18:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-11-06 02:18:05,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 02:18:05,403 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 02:18:05,420 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 02:18:05,620 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 02:18:05,621 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 02:18:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 02:18:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash 249759226, now seen corresponding path program 2 times [2021-11-06 02:18:05,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 02:18:05,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132327880] [2021-11-06 02:18:05,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 02:18:05,622 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 02:18:05,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 02:18:05,623 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 02:18:05,625 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 02:18:06,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 02:18:06,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 02:18:07,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 133 conjunts are in the unsatisfiable core [2021-11-06 02:18:07,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 02:18:15,747 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 02:18:15,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 02:19:01,792 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 02:19:01,793 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 02:19:01,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132327880] [2021-11-06 02:19:01,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132327880] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 02:19:01,793 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 02:19:01,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 264 [2021-11-06 02:19:01,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713619050] [2021-11-06 02:19:01,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 02:19:01,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 264 states [2021-11-06 02:19:01,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 02:19:01,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 264 interpolants. [2021-11-06 02:19:01,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17686, Invalid=51746, Unknown=0, NotChecked=0, Total=69432 [2021-11-06 02:19:01,820 INFO L87 Difference]: Start difference. First operand 635 states and 718 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