./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 00:22:36,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 00:22:36,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 00:22:36,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 00:22:36,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 00:22:36,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 00:22:36,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 00:22:36,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 00:22:36,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 00:22:36,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 00:22:36,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 00:22:36,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 00:22:36,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 00:22:36,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 00:22:36,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 00:22:36,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 00:22:36,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 00:22:36,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 00:22:36,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 00:22:36,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 00:22:36,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 00:22:36,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 00:22:36,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 00:22:36,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 00:22:36,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 00:22:36,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 00:22:36,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 00:22:36,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 00:22:36,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 00:22:36,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 00:22:36,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 00:22:36,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 00:22:36,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 00:22:36,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 00:22:36,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 00:22:36,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 00:22:36,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 00:22:36,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 00:22:36,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 00:22:36,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 00:22:36,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 00:22:36,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-06 00:22:36,672 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 00:22:36,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 00:22:36,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 00:22:36,674 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 00:22:36,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 00:22:36,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 00:22:36,676 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 00:22:36,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 00:22:36,677 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 00:22:36,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 00:22:36,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 00:22:36,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 00:22:36,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 00:22:36,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 00:22:36,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 00:22:36,679 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 00:22:36,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 00:22:36,679 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 00:22:36,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 00:22:36,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 00:22:36,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 00:22:36,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 00:22:36,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:22:36,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 00:22:36,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 00:22:36,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 00:22:36,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 00:22:36,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 00:22:36,681 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 00:22:36,682 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 00:22:36,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 00:22:36,682 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 00:22:36,682 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2021-11-06 00:22:36,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 00:22:37,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 00:22:37,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 00:22:37,025 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 00:22:37,026 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 00:22:37,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2021-11-06 00:22:37,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282a4e9a2/67cd0c366895449599123b238a70b3b4/FLAG1d4629ff2 [2021-11-06 00:22:37,698 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 00:22:37,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2021-11-06 00:22:37,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282a4e9a2/67cd0c366895449599123b238a70b3b4/FLAG1d4629ff2 [2021-11-06 00:22:37,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282a4e9a2/67cd0c366895449599123b238a70b3b4 [2021-11-06 00:22:37,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 00:22:37,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 00:22:37,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 00:22:37,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 00:22:37,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 00:22:38,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:37" (1/1) ... [2021-11-06 00:22:38,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf32e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38, skipping insertion in model container [2021-11-06 00:22:38,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:37" (1/1) ... [2021-11-06 00:22:38,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 00:22:38,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 00:22:38,325 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_BER_test7-1.i[33021,33034] [2021-11-06 00:22:38,413 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_BER_test7-1.i[44124,44137] [2021-11-06 00:22:38,415 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_BER_test7-1.i[44245,44258] [2021-11-06 00:22:38,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:22:38,428 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 00:22:38,470 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_BER_test7-1.i[33021,33034] [2021-11-06 00:22:38,520 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_BER_test7-1.i[44124,44137] [2021-11-06 00:22:38,521 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_BER_test7-1.i[44245,44258] [2021-11-06 00:22:38,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:22:38,578 INFO L208 MainTranslator]: Completed translation [2021-11-06 00:22:38,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38 WrapperNode [2021-11-06 00:22:38,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 00:22:38,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 00:22:38,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 00:22:38,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 00:22:38,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 00:22:38,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 00:22:38,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 00:22:38,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 00:22:38,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 00:22:38,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 00:22:38,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 00:22:38,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 00:22:38,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (1/1) ... [2021-11-06 00:22:38,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:22:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:38,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 00:22:38,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 00:22:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 00:22:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 00:22:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 00:22:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 00:22:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 00:22:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 00:22:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 00:22:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 00:22:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 00:22:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 00:22:38,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 00:22:39,900 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:22:39,901 INFO L299 CfgBuilder]: Removed 73 assume(true) statements. [2021-11-06 00:22:39,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:22:39 BoogieIcfgContainer [2021-11-06 00:22:39,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:22:39,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:22:39,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:22:39,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:22:39,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:22:37" (1/3) ... [2021-11-06 00:22:39,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731d4093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:22:39, skipping insertion in model container [2021-11-06 00:22:39,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:38" (2/3) ... [2021-11-06 00:22:39,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731d4093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:22:39, skipping insertion in model container [2021-11-06 00:22:39,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:22:39" (3/3) ... [2021-11-06 00:22:39,912 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2021-11-06 00:22:39,917 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:22:39,918 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-06 00:22:39,967 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:22:39,976 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 00:22:39,976 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-06 00:22:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 179 states have (on average 1.7094972067039107) internal successors, (306), 181 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-06 00:22:40,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:40,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:40,010 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-06 00:22:40,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:40,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018027205] [2021-11-06 00:22:40,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:40,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:22:40,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:40,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018027205] [2021-11-06 00:22:40,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018027205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:22:40,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:40,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 00:22:40,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865614866] [2021-11-06 00:22:40,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:22:40,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 00:22:40,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:22:40,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 00:22:40,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:22:40,223 INFO L87 Difference]: Start difference. First operand has 182 states, 179 states have (on average 1.7094972067039107) internal successors, (306), 181 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:22:40,272 INFO L93 Difference]: Finished difference Result 361 states and 609 transitions. [2021-11-06 00:22:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 00:22:40,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-06 00:22:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:22:40,283 INFO L225 Difference]: With dead ends: 361 [2021-11-06 00:22:40,283 INFO L226 Difference]: Without dead ends: 177 [2021-11-06 00:22:40,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.06ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:22:40,289 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.67ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 00:22:40,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 3.67ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 00:22:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-06 00:22:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-06 00:22:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 176 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-06 00:22:40,332 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-06 00:22:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:22:40,333 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-06 00:22:40,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-06 00:22:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 00:22:40,334 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:40,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:40,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 00:22:40,335 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-06 00:22:40,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:40,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674098169] [2021-11-06 00:22:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:40,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:22:40,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:40,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674098169] [2021-11-06 00:22:40,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674098169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:22:40,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:40,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:22:40,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292991538] [2021-11-06 00:22:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:22:40,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:22:40,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:22:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:22:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:22:40,395 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:22:40,758 INFO L93 Difference]: Finished difference Result 382 states and 501 transitions. [2021-11-06 00:22:40,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:22:40,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-06 00:22:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:22:40,761 INFO L225 Difference]: With dead ends: 382 [2021-11-06 00:22:40,761 INFO L226 Difference]: Without dead ends: 295 [2021-11-06 00:22:40,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.63ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:22:40,763 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 146 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 284.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.71ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 328.27ms IncrementalHoareTripleChecker+Time [2021-11-06 00:22:40,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 564 Invalid, 158 Unknown, 0 Unchecked, 5.71ms Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 328.27ms Time] [2021-11-06 00:22:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-06 00:22:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 179. [2021-11-06 00:22:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 178 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-06 00:22:40,776 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-06 00:22:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:22:40,776 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-06 00:22:40,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-06 00:22:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:22:40,778 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:40,778 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:40,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 00:22:40,778 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:40,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-06 00:22:40,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:40,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47917432] [2021-11-06 00:22:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:40,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:40,803 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:22:40,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877623881] [2021-11-06 00:22:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:40,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:40,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:40,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:22:40,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 00:22:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:40,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:22:41,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:22:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:22:41,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:22:41,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:41,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47917432] [2021-11-06 00:22:41,258 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:22:41,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877623881] [2021-11-06 00:22:41,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877623881] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:22:41,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:41,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:22:41,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292162900] [2021-11-06 00:22:41,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:22:41,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:22:41,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:22:41,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:22:41,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:22:41,266 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:22:41,334 INFO L93 Difference]: Finished difference Result 375 states and 495 transitions. [2021-11-06 00:22:41,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:22:41,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:22:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:22:41,338 INFO L225 Difference]: With dead ends: 375 [2021-11-06 00:22:41,338 INFO L226 Difference]: Without dead ends: 200 [2021-11-06 00:22:41,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.94ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:22:41,345 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.52ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.23ms IncrementalHoareTripleChecker+Time [2021-11-06 00:22:41,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 409 Invalid, 72 Unknown, 0 Unchecked, 1.52ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 56.23ms Time] [2021-11-06 00:22:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-06 00:22:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2021-11-06 00:22:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 1.2893401015228427) internal successors, (254), 198 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 254 transitions. [2021-11-06 00:22:41,365 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 254 transitions. Word has length 62 [2021-11-06 00:22:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:22:41,366 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 254 transitions. [2021-11-06 00:22:41,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 254 transitions. [2021-11-06 00:22:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:22:41,368 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:41,368 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:41,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 00:22:41,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:41,592 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:41,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:41,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1305568807, now seen corresponding path program 1 times [2021-11-06 00:22:41,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:41,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199221675] [2021-11-06 00:22:41,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:41,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:41,622 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:22:41,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44452425] [2021-11-06 00:22:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:41,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:41,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:41,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:22:41,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 00:22:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:41,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:22:41,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:22:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:22:41,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:22:41,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:41,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199221675] [2021-11-06 00:22:41,936 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:22:41,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44452425] [2021-11-06 00:22:41,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44452425] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:22:41,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:41,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:22:41,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460326079] [2021-11-06 00:22:41,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:22:41,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:22:41,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:22:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:22:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:22:41,938 INFO L87 Difference]: Start difference. First operand 199 states and 254 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:22:42,007 INFO L93 Difference]: Finished difference Result 386 states and 496 transitions. [2021-11-06 00:22:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:22:42,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:22:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:22:42,009 INFO L225 Difference]: With dead ends: 386 [2021-11-06 00:22:42,009 INFO L226 Difference]: Without dead ends: 191 [2021-11-06 00:22:42,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.98ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:22:42,013 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 220 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.68ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.56ms IncrementalHoareTripleChecker+Time [2021-11-06 00:22:42,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 420 Invalid, 66 Unknown, 0 Unchecked, 1.68ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 55.56ms Time] [2021-11-06 00:22:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-06 00:22:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2021-11-06 00:22:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 1.273224043715847) internal successors, (233), 184 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2021-11-06 00:22:42,039 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 62 [2021-11-06 00:22:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:22:42,039 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2021-11-06 00:22:42,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2021-11-06 00:22:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:22:42,042 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:42,042 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:42,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 00:22:42,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-11-06 00:22:42,245 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-06 00:22:42,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:42,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550719553] [2021-11-06 00:22:42,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:42,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:42,260 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:22:42,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070863258] [2021-11-06 00:22:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:42,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:42,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:22:42,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 00:22:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:42,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:22:42,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:22:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:22:42,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:22:42,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:42,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550719553] [2021-11-06 00:22:42,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:22:42,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070863258] [2021-11-06 00:22:42,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070863258] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:22:42,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:42,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:22:42,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566092332] [2021-11-06 00:22:42,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:22:42,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:22:42,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:22:42,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:22:42,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:22:42,691 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:22:42,765 INFO L93 Difference]: Finished difference Result 479 states and 602 transitions. [2021-11-06 00:22:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:22:42,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:22:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:22:42,767 INFO L225 Difference]: With dead ends: 479 [2021-11-06 00:22:42,767 INFO L226 Difference]: Without dead ends: 298 [2021-11-06 00:22:42,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.47ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:22:42,768 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 105 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.15ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.63ms IncrementalHoareTripleChecker+Time [2021-11-06 00:22:42,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 463 Invalid, 32 Unknown, 0 Unchecked, 1.15ms Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 64.63ms Time] [2021-11-06 00:22:42,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-06 00:22:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2021-11-06 00:22:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 289 states have (on average 1.2664359861591696) internal successors, (366), 290 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 366 transitions. [2021-11-06 00:22:42,779 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 366 transitions. Word has length 62 [2021-11-06 00:22:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:22:42,780 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 366 transitions. [2021-11-06 00:22:42,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 366 transitions. [2021-11-06 00:22:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 00:22:42,785 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:42,785 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:42,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 00:22:42,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:43,000 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-06 00:22:43,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:43,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136250433] [2021-11-06 00:22:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:43,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:43,016 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:22:43,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817900077] [2021-11-06 00:22:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:43,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:43,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:22:43,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 00:22:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:43,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:22:43,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:22:43,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 00:22:43,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-06 00:22:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:22:43,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:22:43,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:43,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136250433] [2021-11-06 00:22:43,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:22:43,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817900077] [2021-11-06 00:22:43,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817900077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:22:43,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:43,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:22:43,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956679011] [2021-11-06 00:22:43,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:22:43,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:22:43,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:22:43,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:22:43,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:22:43,356 INFO L87 Difference]: Start difference. First operand 291 states and 366 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:22:43,630 INFO L93 Difference]: Finished difference Result 379 states and 483 transitions. [2021-11-06 00:22:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:22:43,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 00:22:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:22:43,632 INFO L225 Difference]: With dead ends: 379 [2021-11-06 00:22:43,632 INFO L226 Difference]: Without dead ends: 375 [2021-11-06 00:22:43,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.85ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:22:43,633 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 135 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 206.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.86ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 250.56ms IncrementalHoareTripleChecker+Time [2021-11-06 00:22:43,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 564 Invalid, 137 Unknown, 0 Unchecked, 2.86ms Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 250.56ms Time] [2021-11-06 00:22:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-06 00:22:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 293. [2021-11-06 00:22:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 291 states have (on average 1.2646048109965635) internal successors, (368), 292 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 368 transitions. [2021-11-06 00:22:43,644 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 368 transitions. Word has length 69 [2021-11-06 00:22:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:22:43,644 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 368 transitions. [2021-11-06 00:22:43,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 368 transitions. [2021-11-06 00:22:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:22:43,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:43,646 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:43,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-06 00:22:43,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:43,868 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2000986198, now seen corresponding path program 1 times [2021-11-06 00:22:43,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:43,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405029673] [2021-11-06 00:22:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:43,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:43,894 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:22:43,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959149327] [2021-11-06 00:22:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:43,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:43,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:43,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:22:43,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 00:22:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:44,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:22:44,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:22:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:22:44,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:22:44,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:44,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405029673] [2021-11-06 00:22:44,222 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:22:44,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959149327] [2021-11-06 00:22:44,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959149327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:22:44,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:44,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:22:44,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456350345] [2021-11-06 00:22:44,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:22:44,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:22:44,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:22:44,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:22:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:22:44,225 INFO L87 Difference]: Start difference. First operand 293 states and 368 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:22:44,299 INFO L93 Difference]: Finished difference Result 483 states and 627 transitions. [2021-11-06 00:22:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:22:44,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:22:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:22:44,302 INFO L225 Difference]: With dead ends: 483 [2021-11-06 00:22:44,302 INFO L226 Difference]: Without dead ends: 335 [2021-11-06 00:22:44,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.08ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:22:44,304 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.01ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.84ms IncrementalHoareTripleChecker+Time [2021-11-06 00:22:44,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 395 Invalid, 72 Unknown, 0 Unchecked, 1.01ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 53.84ms Time] [2021-11-06 00:22:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-06 00:22:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2021-11-06 00:22:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 332 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 408 transitions. [2021-11-06 00:22:44,332 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 408 transitions. Word has length 103 [2021-11-06 00:22:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:22:44,332 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 408 transitions. [2021-11-06 00:22:44,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 408 transitions. [2021-11-06 00:22:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:22:44,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:44,333 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:44,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-06 00:22:44,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:44,534 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:44,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1973776046, now seen corresponding path program 1 times [2021-11-06 00:22:44,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:44,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417127332] [2021-11-06 00:22:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:44,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:44,548 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:22:44,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519748041] [2021-11-06 00:22:44,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:44,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:44,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:44,550 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:22:44,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 00:22:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:44,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:22:44,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:22:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:22:44,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:22:44,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:44,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417127332] [2021-11-06 00:22:44,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:22:44,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519748041] [2021-11-06 00:22:44,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519748041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:22:44,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:44,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:22:44,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762049893] [2021-11-06 00:22:44,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:22:44,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:22:44,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:22:44,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:22:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:22:44,877 INFO L87 Difference]: Start difference. First operand 333 states and 408 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:44,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:22:44,948 INFO L93 Difference]: Finished difference Result 498 states and 622 transitions. [2021-11-06 00:22:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:22:44,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:22:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:22:44,955 INFO L225 Difference]: With dead ends: 498 [2021-11-06 00:22:44,955 INFO L226 Difference]: Without dead ends: 310 [2021-11-06 00:22:44,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.53ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:22:44,956 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 103 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.24ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.04ms IncrementalHoareTripleChecker+Time [2021-11-06 00:22:44,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 510 Invalid, 66 Unknown, 0 Unchecked, 1.24ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 57.04ms Time] [2021-11-06 00:22:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-06 00:22:44,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 305. [2021-11-06 00:22:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 303 states have (on average 1.2079207920792079) internal successors, (366), 304 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 366 transitions. [2021-11-06 00:22:44,965 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 366 transitions. Word has length 103 [2021-11-06 00:22:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:22:44,966 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 366 transitions. [2021-11-06 00:22:44,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 366 transitions. [2021-11-06 00:22:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:22:44,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:44,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-06 00:22:45,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:45,184 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1090927200, now seen corresponding path program 1 times [2021-11-06 00:22:45,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:45,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099612509] [2021-11-06 00:22:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:45,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:45,196 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:22:45,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109915723] [2021-11-06 00:22:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:45,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:45,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:45,198 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:22:45,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 00:22:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:45,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:22:45,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:22:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:22:45,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:22:45,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:45,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099612509] [2021-11-06 00:22:45,571 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:22:45,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109915723] [2021-11-06 00:22:45,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109915723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:22:45,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:45,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:22:45,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110699249] [2021-11-06 00:22:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:22:45,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:22:45,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:22:45,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:22:45,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:22:45,573 INFO L87 Difference]: Start difference. First operand 305 states and 366 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:22:45,789 INFO L93 Difference]: Finished difference Result 653 states and 790 transitions. [2021-11-06 00:22:45,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:22:45,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:22:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:22:45,792 INFO L225 Difference]: With dead ends: 653 [2021-11-06 00:22:45,792 INFO L226 Difference]: Without dead ends: 396 [2021-11-06 00:22:45,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.47ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:22:45,793 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 416 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 156.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.54ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 190.30ms IncrementalHoareTripleChecker+Time [2021-11-06 00:22:45,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 365 Invalid, 77 Unknown, 0 Unchecked, 2.54ms Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 190.30ms Time] [2021-11-06 00:22:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-06 00:22:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2021-11-06 00:22:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 387 states have (on average 1.2144702842377262) internal successors, (470), 388 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 470 transitions. [2021-11-06 00:22:45,806 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 470 transitions. Word has length 103 [2021-11-06 00:22:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:22:45,807 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 470 transitions. [2021-11-06 00:22:45,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:22:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 470 transitions. [2021-11-06 00:22:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-06 00:22:45,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:22:45,808 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:45,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-06 00:22:46,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:46,032 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:22:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:22:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash 541561274, now seen corresponding path program 1 times [2021-11-06 00:22:46,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:22:46,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358693839] [2021-11-06 00:22:46,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:46,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:22:46,045 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:22:46,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600756819] [2021-11-06 00:22:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:22:46,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:22:46,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:46,047 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:22:46,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 00:22:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:22:46,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-06 00:22:46,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:22:46,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 00:22:46,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-06 00:22:46,275 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 00:22:46,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-06 00:22:46,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:46,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:46,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-11-06 00:22:47,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2021-11-06 00:22:47,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2021-11-06 00:22:47,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2021-11-06 00:22:47,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 00:22:47,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:47,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-06 00:22:47,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2021-11-06 00:22:47,456 INFO L354 Elim1Store]: treesize reduction 70, result has 23.1 percent of original size [2021-11-06 00:22:47,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 52 [2021-11-06 00:22:48,819 INFO L354 Elim1Store]: treesize reduction 364, result has 11.9 percent of original size [2021-11-06 00:22:48,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 2853 treesize of output 2296 [2021-11-06 00:22:48,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:48,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:48,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:22:53,348 INFO L354 Elim1Store]: treesize reduction 7776, result has 3.0 percent of original size [2021-11-06 00:22:53,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 3322 treesize of output 1825 [2021-11-06 00:22:53,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:22:53,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358693839] [2021-11-06 00:22:53,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:22:53,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600756819] [2021-11-06 00:22:53,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-06 00:22:53,428 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:22:53,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 00:22:53,428 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-06 00:22:53,431 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 00:22:53,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-06 00:22:53,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-06 00:22:53,463 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 00:22:53,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-06 00:22:53,646 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:22:53,649 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 00:22:53,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:22:53 BoogieIcfgContainer [2021-11-06 00:22:53,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 00:22:53,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 00:22:53,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 00:22:53,691 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 00:22:53,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:22:39" (3/4) ... [2021-11-06 00:22:53,694 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 00:22:53,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 00:22:53,695 INFO L158 Benchmark]: Toolchain (without parser) took 15703.93ms. Allocated memory was 60.8MB in the beginning and 161.5MB in the end (delta: 100.7MB). Free memory was 37.2MB in the beginning and 122.1MB in the end (delta: -84.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2021-11-06 00:22:53,695 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.8MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 00:22:53,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.85ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 37.0MB in the beginning and 54.0MB in the end (delta: -17.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2021-11-06 00:22:53,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.00ms. Allocated memory is still 75.5MB. Free memory was 54.0MB in the beginning and 47.5MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-06 00:22:53,696 INFO L158 Benchmark]: Boogie Preprocessor took 108.16ms. Allocated memory is still 75.5MB. Free memory was 47.5MB in the beginning and 40.3MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-06 00:22:53,696 INFO L158 Benchmark]: RCFGBuilder took 1127.12ms. Allocated memory is still 75.5MB. Free memory was 40.3MB in the beginning and 36.0MB in the end (delta: 4.3MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2021-11-06 00:22:53,697 INFO L158 Benchmark]: TraceAbstraction took 13783.93ms. Allocated memory was 75.5MB in the beginning and 161.5MB in the end (delta: 86.0MB). Free memory was 35.4MB in the beginning and 123.1MB in the end (delta: -87.7MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. [2021-11-06 00:22:53,697 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 161.5MB. Free memory was 123.1MB in the beginning and 122.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-06 00:22:53,698 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.25ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.8MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.85ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 37.0MB in the beginning and 54.0MB in the end (delta: -17.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.00ms. Allocated memory is still 75.5MB. Free memory was 54.0MB in the beginning and 47.5MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.16ms. Allocated memory is still 75.5MB. Free memory was 47.5MB in the beginning and 40.3MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1127.12ms. Allocated memory is still 75.5MB. Free memory was 40.3MB in the beginning and 36.0MB in the end (delta: 4.3MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13783.93ms. Allocated memory was 75.5MB in the beginning and 161.5MB in the end (delta: 86.0MB). Free memory was 35.4MB in the beginning and 123.1MB in the end (delta: -87.7MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 161.5MB. Free memory was 123.1MB in the beginning and 122.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 730]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of bitwiseXor at line 725, overapproximation of bitwiseAnd at line 725. Possible FailurePath: [L713] int i; [L714] example_user_t *user, *tmp, *users=((void *)0); [L715] i=0 [L715] EXPR \read(i) [L715] COND TRUE i<1000 [L716] user = (example_user_t*)malloc(sizeof(example_user_t)) [L717] COND FALSE !(user == ((void *)0)) [L720] EXPR \read(i) [L720] user->id = i [L721] EXPR \read(i) [L721] EXPR \read(i) [L721] user->cookie = i*i [L722] unsigned _ha_hashv; [L722] unsigned _hj_i,_hj_j,_hj_k; [L722] unsigned const char *_hj_key=(unsigned const char*)(&((user)->id)); [L722] _ha_hashv = 0xfeedbeefu [L722] EXPR _hj_j = 0x9e3779b9u [L722] _hj_i = _hj_j = 0x9e3779b9u [L722] _hj_k = (unsigned)(sizeof(int)) [L722] COND FALSE !(_hj_k >= 12U) [L722] _ha_hashv += (unsigned)(sizeof(int)) [L722] case 11: [L722] case 10: [L722] case 9: [L722] case 8: [L722] case 7: [L722] case 6: [L722] case 5: [L722] case 4: [L722] EXPR _hj_key[3] [L722] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L722] case 3: [L722] EXPR _hj_key[2] [L722] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L722] case 2: [L722] EXPR _hj_key[1] [L722] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L722] case 1: [L722] EXPR _hj_key[0] [L722] _hj_i += _hj_key[0] [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 13 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 8 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 13 ) [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 12 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 16 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 5 ) [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 3 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 10 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 15 ) [L722] (user)->hh.hashv = (_ha_hashv) [L722] (user)->hh.key = (char*) (&((user)->id)) [L722] (user)->hh.keylen = (unsigned) (sizeof(int)) [L722] COND TRUE !(users) [L722] (user)->hh.next = ((void *)0) [L722] (user)->hh.prev = ((void *)0) [L722] (user)->hh.tbl = (UT_hash_table*)malloc(sizeof(UT_hash_table)) [L722] EXPR (user)->hh.tbl [L722] COND FALSE !(!(user)->hh.tbl) [L722] (user)->hh.tbl [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->tail = &((user)->hh) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->num_buckets = 32U [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->log2_num_buckets = 5U [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->hho = (char*)(&(user)->hh) - (char*)(user) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->buckets = (UT_hash_bucket*)malloc(32U * sizeof(struct UT_hash_bucket)) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->signature = 0xa0111fe1u [L722] EXPR (user)->hh.tbl [L722] EXPR (user)->hh.tbl->buckets [L722] COND FALSE !(!(user)->hh.tbl->buckets) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->buckets [L722] (users) = (user) [L722] unsigned _ha_bkt; [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->num_items [L722] (users)->hh.tbl->num_items++ [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->num_buckets [L722] _ha_bkt = ((_ha_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->buckets [L722] UT_hash_bucket *_ha_head = &((users)->hh.tbl->buckets[_ha_bkt]); [L722] EXPR _ha_head->count [L722] _ha_head->count++ [L722] EXPR _ha_head->hh_head [L722] (&(user)->hh)->hh_next = _ha_head->hh_head [L722] (&(user)->hh)->hh_prev = ((void *)0) [L722] EXPR _ha_head->hh_head [L722] COND FALSE !(_ha_head->hh_head != ((void *)0)) [L722] _ha_head->hh_head = (&(user)->hh) [L722] EXPR _ha_head->count [L722] EXPR _ha_head->expand_mult [L722] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L722] EXPR (&(user)->hh)->tbl [L722] EXPR (&(user)->hh)->tbl->noexpand [L722] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L722] COND FALSE !((_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand) [L715] EXPR \read(i) [L715] i++ [L715] EXPR \read(i) [L715] COND FALSE !(i<1000) [L724] i=0 [L724] EXPR \read(i) [L724] COND TRUE i<1000 [L725] unsigned _hf_hashv; [L725] unsigned _hj_i,_hj_j,_hj_k; [L725] unsigned const char *_hj_key=(unsigned const char*)(&i); [L725] _hf_hashv = 0xfeedbeefu [L725] EXPR _hj_j = 0x9e3779b9u [L725] _hj_i = _hj_j = 0x9e3779b9u [L725] _hj_k = (unsigned)(sizeof(int)) [L725] COND FALSE !(_hj_k >= 12U) [L725] _hf_hashv += (unsigned)(sizeof(int)) [L725] case 11: [L725] case 10: [L725] case 9: [L725] case 8: [L725] case 7: [L725] case 6: [L725] case 5: [L725] case 4: [L725] EXPR _hj_key[3] [L725] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L725] case 3: [L725] EXPR _hj_key[2] [L725] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L725] case 2: [L725] EXPR _hj_key[1] [L725] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L725] case 1: [L725] EXPR _hj_key[0] [L725] _hj_i += _hj_key[0] [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 13 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 8 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 13 ) [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 12 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 16 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 5 ) [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 3 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 10 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 15 ) [L725] (tmp) = ((void *)0) [L725] COND TRUE \read(*users) [L725] unsigned _hf_bkt; [L725] EXPR (users)->hh.tbl [L725] EXPR (users)->hh.tbl->num_buckets [L725] _hf_bkt = ((_hf_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L725] EXPR (users)->hh.tbl [L725] EXPR (users)->hh.tbl->buckets [L725] EXPR ((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head [L725] COND FALSE !(((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head != ((void *)0)) [L725] (tmp) = ((void *)0) [L725] COND FALSE !((tmp) != ((void *)0)) [L726] COND FALSE !(tmp != ((void *)0)) [L730] reach_error() - UnprovableResult [Line: 734]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 182 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 13682.70ms, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 30.28ms, AutomataDifference: 1378.14ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 16.08ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1143 SdHoareTripleChecker+Valid, 1056.43ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1143 mSDsluCounter, 3926 SdHoareTripleChecker+Invalid, 879.56ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1958 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 561 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 1968 mSDtfsCounter, 561 mSolverCounterSat, 21.39ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.01ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=9, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 146.91ms AutomataMinimizationTime, 9 MinimizatonAttempts, 226 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 398.51ms SsaConstructionTime, 427.00ms SatisfiabilityAnalysisTime, 8746.06ms InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2243 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-06 00:22:53,747 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_BER_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 00:22:55,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 00:22:55,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 00:22:55,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 00:22:55,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 00:22:55,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 00:22:55,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 00:22:55,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 00:22:55,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 00:22:55,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 00:22:55,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 00:22:55,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 00:22:55,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 00:22:55,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 00:22:55,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 00:22:55,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 00:22:55,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 00:22:55,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 00:22:55,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 00:22:55,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 00:22:55,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 00:22:55,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 00:22:55,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 00:22:55,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 00:22:55,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 00:22:55,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 00:22:55,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 00:22:55,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 00:22:55,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 00:22:55,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 00:22:55,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 00:22:55,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 00:22:55,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 00:22:55,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 00:22:55,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 00:22:55,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 00:22:55,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 00:22:55,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 00:22:55,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 00:22:55,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 00:22:55,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 00:22:55,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-06 00:22:55,823 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 00:22:55,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 00:22:55,825 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 00:22:55,825 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 00:22:55,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 00:22:55,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 00:22:55,828 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 00:22:55,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 00:22:55,828 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 00:22:55,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 00:22:55,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 00:22:55,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 00:22:55,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 00:22:55,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 00:22:55,830 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 00:22:55,830 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 00:22:55,830 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 00:22:55,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 00:22:55,831 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 00:22:55,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 00:22:55,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 00:22:55,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 00:22:55,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 00:22:55,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:22:55,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 00:22:55,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 00:22:55,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 00:22:55,832 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 00:22:55,833 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 00:22:55,833 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 00:22:55,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 00:22:55,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 00:22:55,834 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 00:22:55,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 00:22:55,834 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2021-11-06 00:22:56,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 00:22:56,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 00:22:56,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 00:22:56,204 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 00:22:56,211 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 00:22:56,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2021-11-06 00:22:56,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae8d4a86e/48f10cb38f49478cbbf708d2d8ca1241/FLAG1d926e5d7 [2021-11-06 00:22:56,772 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 00:22:56,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2021-11-06 00:22:56,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae8d4a86e/48f10cb38f49478cbbf708d2d8ca1241/FLAG1d926e5d7 [2021-11-06 00:22:57,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae8d4a86e/48f10cb38f49478cbbf708d2d8ca1241 [2021-11-06 00:22:57,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 00:22:57,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 00:22:57,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 00:22:57,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 00:22:57,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 00:22:57,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:57,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f53216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57, skipping insertion in model container [2021-11-06 00:22:57,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:57,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 00:22:57,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 00:22:57,547 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_BER_test7-1.i[33021,33034] [2021-11-06 00:22:57,696 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_BER_test7-1.i[44124,44137] [2021-11-06 00:22:57,702 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_BER_test7-1.i[44245,44258] [2021-11-06 00:22:57,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:22:57,726 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 00:22:57,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[33021,33034] [2021-11-06 00:22:57,847 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_BER_test7-1.i[44124,44137] [2021-11-06 00:22:57,848 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_BER_test7-1.i[44245,44258] [2021-11-06 00:22:57,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:22:57,889 INFO L208 MainTranslator]: Completed translation [2021-11-06 00:22:57,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57 WrapperNode [2021-11-06 00:22:57,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 00:22:57,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 00:22:57,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 00:22:57,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 00:22:57,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:57,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:58,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 00:22:58,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 00:22:58,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 00:22:58,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 00:22:58,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:58,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:58,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:58,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:58,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:58,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:58,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:58,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 00:22:58,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 00:22:58,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 00:22:58,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 00:22:58,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (1/1) ... [2021-11-06 00:22:58,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:22:58,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:58,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 00:22:58,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 00:22:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 00:22:58,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 00:22:58,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 00:22:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 00:22:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 00:22:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 00:22:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 00:22:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 00:22:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 00:22:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 00:22:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 00:22:58,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 00:23:01,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:23:01,592 INFO L299 CfgBuilder]: Removed 73 assume(true) statements. [2021-11-06 00:23:01,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:23:01 BoogieIcfgContainer [2021-11-06 00:23:01,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:23:01,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:23:01,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:23:01,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:23:01,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:22:57" (1/3) ... [2021-11-06 00:23:01,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49538f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:23:01, skipping insertion in model container [2021-11-06 00:23:01,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:57" (2/3) ... [2021-11-06 00:23:01,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49538f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:23:01, skipping insertion in model container [2021-11-06 00:23:01,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:23:01" (3/3) ... [2021-11-06 00:23:01,603 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2021-11-06 00:23:01,610 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:23:01,611 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-06 00:23:01,654 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:23:01,660 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 00:23:01,660 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-06 00:23:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 179 states have (on average 1.7094972067039107) internal successors, (306), 181 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-06 00:23:01,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:01,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:01,683 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-06 00:23:01,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:01,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538303540] [2021-11-06 00:23:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:01,697 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:01,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:01,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:01,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-06 00:23:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:01,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-06 00:23:01,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:01,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:01,955 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:01,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538303540] [2021-11-06 00:23:01,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538303540] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:01,956 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:01,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 00:23:01,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710994214] [2021-11-06 00:23:01,958 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:01,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 00:23:01,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 00:23:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:23:01,986 INFO L87 Difference]: Start difference. First operand has 182 states, 179 states have (on average 1.7094972067039107) internal successors, (306), 181 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:02,017 INFO L93 Difference]: Finished difference Result 361 states and 609 transitions. [2021-11-06 00:23:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 00:23:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-06 00:23:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:02,028 INFO L225 Difference]: With dead ends: 361 [2021-11-06 00:23:02,028 INFO L226 Difference]: Without dead ends: 177 [2021-11-06 00:23:02,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.08ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:23:02,034 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.18ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:02,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.18ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 00:23:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-06 00:23:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-06 00:23:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 176 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-06 00:23:02,072 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-06 00:23:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:02,072 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-06 00:23:02,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-06 00:23:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 00:23:02,073 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:02,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:02,081 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 00:23:02,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:02,276 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-06 00:23:02,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:02,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686170575] [2021-11-06 00:23:02,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:02,277 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:02,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:02,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:02,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-06 00:23:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:02,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:02,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:02,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 00:23:02,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-06 00:23:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:02,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:02,627 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:02,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686170575] [2021-11-06 00:23:02,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686170575] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:02,627 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:02,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 00:23:02,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916812040] [2021-11-06 00:23:02,628 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:02,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:23:02,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:23:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:23:02,630 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:05,679 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:23:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:06,861 INFO L93 Difference]: Finished difference Result 468 states and 614 transitions. [2021-11-06 00:23:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:23:06,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-06 00:23:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:06,866 INFO L225 Difference]: With dead ends: 468 [2021-11-06 00:23:06,866 INFO L226 Difference]: Without dead ends: 381 [2021-11-06 00:23:06,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.02ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:23:06,868 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 396 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3889.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.09ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4158.18ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:06,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 858 Invalid, 253 Unknown, 0 Unchecked, 11.09ms Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 1 Unknown, 0 Unchecked, 4158.18ms Time] [2021-11-06 00:23:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-06 00:23:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 179. [2021-11-06 00:23:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 178 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-06 00:23:06,896 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-06 00:23:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:06,898 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-06 00:23:06,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-06 00:23:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:23:06,900 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:06,900 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:06,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:07,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:07,101 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-06 00:23:07,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:07,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148742907] [2021-11-06 00:23:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:07,103 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:07,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:07,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:07,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-06 00:23:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:07,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:07,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:07,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:07,675 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:07,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148742907] [2021-11-06 00:23:07,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148742907] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:07,676 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:07,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:23:07,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046832331] [2021-11-06 00:23:07,676 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:07,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:23:07,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:07,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:23:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:07,678 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:07,806 INFO L93 Difference]: Finished difference Result 363 states and 476 transitions. [2021-11-06 00:23:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:23:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:07,808 INFO L225 Difference]: With dead ends: 363 [2021-11-06 00:23:07,808 INFO L226 Difference]: Without dead ends: 188 [2021-11-06 00:23:07,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.52ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:23:07,810 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 427 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.31ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 105.96ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:07,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 416 Invalid, 75 Unknown, 0 Unchecked, 2.31ms Time], IncrementalHoareTripleChecker [37 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 105.96ms Time] [2021-11-06 00:23:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-06 00:23:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2021-11-06 00:23:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.2722222222222221) internal successors, (229), 181 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2021-11-06 00:23:07,821 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 62 [2021-11-06 00:23:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:07,821 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2021-11-06 00:23:07,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2021-11-06 00:23:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:23:07,823 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:07,823 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:07,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-06 00:23:08,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:08,038 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-06 00:23:08,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:08,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733440446] [2021-11-06 00:23:08,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:08,040 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:08,041 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:08,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-06 00:23:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:08,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:08,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:08,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:09,092 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:09,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733440446] [2021-11-06 00:23:09,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733440446] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:09,092 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:09,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 00:23:09,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879646783] [2021-11-06 00:23:09,093 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:09,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:23:09,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:09,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:23:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:09,094 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:09,686 INFO L93 Difference]: Finished difference Result 470 states and 590 transitions. [2021-11-06 00:23:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:23:09,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:23:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:09,688 INFO L225 Difference]: With dead ends: 470 [2021-11-06 00:23:09,688 INFO L226 Difference]: Without dead ends: 292 [2021-11-06 00:23:09,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.01ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:09,690 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 101 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 531.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.74ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 576.77ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:09,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 451 Invalid, 36 Unknown, 0 Unchecked, 1.74ms Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 576.77ms Time] [2021-11-06 00:23:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-06 00:23:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 285. [2021-11-06 00:23:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 283 states have (on average 1.265017667844523) internal successors, (358), 284 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 358 transitions. [2021-11-06 00:23:09,703 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 358 transitions. Word has length 62 [2021-11-06 00:23:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:09,703 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 358 transitions. [2021-11-06 00:23:09,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 358 transitions. [2021-11-06 00:23:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 00:23:09,705 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:09,705 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:09,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:09,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:09,919 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-06 00:23:09,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:09,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662844281] [2021-11-06 00:23:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:09,921 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:09,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:09,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:09,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-06 00:23:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:10,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:10,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:10,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:10,380 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:10,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662844281] [2021-11-06 00:23:10,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662844281] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:10,380 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:10,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:23:10,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050849895] [2021-11-06 00:23:10,381 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:10,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:23:10,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:10,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:23:10,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:23:10,382 INFO L87 Difference]: Start difference. First operand 285 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:10,472 INFO L93 Difference]: Finished difference Result 528 states and 673 transitions. [2021-11-06 00:23:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:10,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 00:23:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:10,474 INFO L225 Difference]: With dead ends: 528 [2021-11-06 00:23:10,474 INFO L226 Difference]: Without dead ends: 288 [2021-11-06 00:23:10,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.46ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:23:10,475 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.97ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.28ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:10,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 20 Unknown, 0 Unchecked, 0.97ms Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 75.28ms Time] [2021-11-06 00:23:10,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-06 00:23:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-11-06 00:23:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 286 states have (on average 1.2622377622377623) internal successors, (361), 287 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 361 transitions. [2021-11-06 00:23:10,484 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 361 transitions. Word has length 69 [2021-11-06 00:23:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:10,484 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 361 transitions. [2021-11-06 00:23:10,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 361 transitions. [2021-11-06 00:23:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 00:23:10,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:10,491 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:10,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:10,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:10,706 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash 982130832, now seen corresponding path program 1 times [2021-11-06 00:23:10,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:10,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752571590] [2021-11-06 00:23:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:10,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:10,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:10,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:10,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-06 00:23:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:10,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:23:10,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 00:23:11,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 00:23:11,320 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:11,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752571590] [2021-11-06 00:23:11,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752571590] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:23:11,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:23:11,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-06 00:23:11,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48834238] [2021-11-06 00:23:11,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:23:11,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:23:11,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:11,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:23:11,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:23:11,322 INFO L87 Difference]: Start difference. First operand 288 states and 361 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:11,619 INFO L93 Difference]: Finished difference Result 537 states and 685 transitions. [2021-11-06 00:23:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 00:23:11,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-06 00:23:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:11,622 INFO L225 Difference]: With dead ends: 537 [2021-11-06 00:23:11,622 INFO L226 Difference]: Without dead ends: 294 [2021-11-06 00:23:11,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 183.71ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-06 00:23:11,623 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 165.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 188.98ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:11,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1067 Invalid, 57 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 188.98ms Time] [2021-11-06 00:23:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-06 00:23:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-06 00:23:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 292 states have (on average 1.2568493150684932) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2021-11-06 00:23:11,633 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 72 [2021-11-06 00:23:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:11,633 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2021-11-06 00:23:11,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2021-11-06 00:23:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 00:23:11,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:11,635 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:11,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:11,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:11,849 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:11,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2058438736, now seen corresponding path program 2 times [2021-11-06 00:23:11,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:11,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905768720] [2021-11-06 00:23:11,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:23:11,850 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:11,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:11,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:11,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-06 00:23:11,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:23:11,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:23:11,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:11,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:12,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 00:23:12,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-06 00:23:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 00:23:12,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 00:23:12,205 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:12,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905768720] [2021-11-06 00:23:12,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905768720] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:12,208 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:12,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 00:23:12,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563307472] [2021-11-06 00:23:12,208 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:12,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:23:12,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:23:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:23:12,210 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:14,288 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:23:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:15,917 INFO L93 Difference]: Finished difference Result 448 states and 571 transitions. [2021-11-06 00:23:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:23:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-06 00:23:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:15,922 INFO L225 Difference]: With dead ends: 448 [2021-11-06 00:23:15,922 INFO L226 Difference]: Without dead ends: 444 [2021-11-06 00:23:15,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.32ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:23:15,923 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 338 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3437.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.32ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3645.46ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:15,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 823 Invalid, 218 Unknown, 0 Unchecked, 5.32ms Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 3645.46ms Time] [2021-11-06 00:23:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-06 00:23:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 365. [2021-11-06 00:23:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 363 states have (on average 1.2754820936639117) internal successors, (463), 364 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 463 transitions. [2021-11-06 00:23:15,938 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 463 transitions. Word has length 78 [2021-11-06 00:23:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:15,938 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 463 transitions. [2021-11-06 00:23:15,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 463 transitions. [2021-11-06 00:23:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 00:23:15,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:15,941 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:15,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:16,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:16,152 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:16,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1224331210, now seen corresponding path program 1 times [2021-11-06 00:23:16,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:16,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319681681] [2021-11-06 00:23:16,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:16,155 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:16,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:16,156 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:16,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 00:23:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:16,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 00:23:16,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:23:16,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:23:17,485 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:17,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319681681] [2021-11-06 00:23:17,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319681681] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:23:17,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:23:17,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-06 00:23:17,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986299617] [2021-11-06 00:23:17,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:23:17,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 00:23:17,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:17,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 00:23:17,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-06 00:23:17,488 INFO L87 Difference]: Start difference. First operand 365 states and 463 transitions. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:19,225 INFO L93 Difference]: Finished difference Result 697 states and 901 transitions. [2021-11-06 00:23:19,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 00:23:19,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-06 00:23:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:19,228 INFO L225 Difference]: With dead ends: 697 [2021-11-06 00:23:19,228 INFO L226 Difference]: Without dead ends: 377 [2021-11-06 00:23:19,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1161.54ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-06 00:23:19,229 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1012.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.51ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1081.92ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:19,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1915 Invalid, 164 Unknown, 0 Unchecked, 3.51ms Time], IncrementalHoareTripleChecker [45 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1081.92ms Time] [2021-11-06 00:23:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-06 00:23:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-11-06 00:23:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.2666666666666666) internal successors, (475), 376 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 475 transitions. [2021-11-06 00:23:19,241 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 475 transitions. Word has length 112 [2021-11-06 00:23:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:19,242 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 475 transitions. [2021-11-06 00:23:19,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 475 transitions. [2021-11-06 00:23:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 00:23:19,243 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:19,243 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:19,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:19,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:19,459 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2016870474, now seen corresponding path program 2 times [2021-11-06 00:23:19,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:19,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698309536] [2021-11-06 00:23:19,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:23:19,460 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:19,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:19,461 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:19,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 00:23:19,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:23:19,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:23:19,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:19,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 00:23:19,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 00:23:20,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:20,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698309536] [2021-11-06 00:23:20,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698309536] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:20,006 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:20,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:23:20,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525488769] [2021-11-06 00:23:20,006 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:20,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:23:20,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:23:20,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:20,007 INFO L87 Difference]: Start difference. First operand 377 states and 475 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:20,127 INFO L93 Difference]: Finished difference Result 603 states and 784 transitions. [2021-11-06 00:23:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:20,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-11-06 00:23:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:20,129 INFO L225 Difference]: With dead ends: 603 [2021-11-06 00:23:20,129 INFO L226 Difference]: Without dead ends: 389 [2021-11-06 00:23:20,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.95ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:23:20,130 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 101 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.44ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 94.69ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:20,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 604 Invalid, 68 Unknown, 0 Unchecked, 1.44ms Time], IncrementalHoareTripleChecker [30 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 94.69ms Time] [2021-11-06 00:23:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-06 00:23:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2021-11-06 00:23:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 384 states have (on average 1.1979166666666667) internal successors, (460), 385 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2021-11-06 00:23:20,143 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 124 [2021-11-06 00:23:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:20,143 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2021-11-06 00:23:20,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2021-11-06 00:23:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 00:23:20,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:20,145 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:20,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:20,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:20,356 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:20,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1333208362, now seen corresponding path program 1 times [2021-11-06 00:23:20,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:20,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153807601] [2021-11-06 00:23:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:20,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:20,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:20,359 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:20,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 00:23:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:20,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 00:23:20,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 00:23:21,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 00:23:22,601 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:22,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153807601] [2021-11-06 00:23:22,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153807601] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:23:22,602 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:23:22,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-06 00:23:22,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440616365] [2021-11-06 00:23:22,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:23:22,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-06 00:23:22,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:22,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-06 00:23:22,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-11-06 00:23:22,604 INFO L87 Difference]: Start difference. First operand 386 states and 460 transitions. Second operand has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:33,079 INFO L93 Difference]: Finished difference Result 751 states and 919 transitions. [2021-11-06 00:23:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 00:23:33,080 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-11-06 00:23:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:33,081 INFO L225 Difference]: With dead ends: 751 [2021-11-06 00:23:33,081 INFO L226 Difference]: Without dead ends: 410 [2021-11-06 00:23:33,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 5221.29ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-11-06 00:23:33,083 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6275.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3223 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.90ms SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6513.88ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:33,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3223 Invalid, 520 Unknown, 0 Unchecked, 8.90ms Time], IncrementalHoareTripleChecker [157 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 6513.88ms Time] [2021-11-06 00:23:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-06 00:23:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-11-06 00:23:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 1.1862745098039216) internal successors, (484), 409 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2021-11-06 00:23:33,097 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 124 [2021-11-06 00:23:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:33,097 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2021-11-06 00:23:33,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2021-11-06 00:23:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 00:23:33,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:33,100 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:33,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:33,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:33,316 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2039593942, now seen corresponding path program 2 times [2021-11-06 00:23:33,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:33,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022742471] [2021-11-06 00:23:33,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:23:33,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:33,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:33,318 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:33,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 00:23:33,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:23:33,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:23:33,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:23:33,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 00:23:33,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 00:23:33,941 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:33,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022742471] [2021-11-06 00:23:33,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022742471] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:33,941 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:33,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [] total 5 [2021-11-06 00:23:33,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366329896] [2021-11-06 00:23:33,941 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:33,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:23:33,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:33,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:23:33,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:33,943 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:34,022 INFO L93 Difference]: Finished difference Result 611 states and 731 transitions. [2021-11-06 00:23:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:23:34,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-11-06 00:23:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:34,025 INFO L225 Difference]: With dead ends: 611 [2021-11-06 00:23:34,025 INFO L226 Difference]: Without dead ends: 413 [2021-11-06 00:23:34,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.26ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:34,027 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.78ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.10ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:34,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 384 Invalid, 40 Unknown, 0 Unchecked, 0.78ms Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 66.10ms Time] [2021-11-06 00:23:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-06 00:23:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2021-11-06 00:23:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 1.1642156862745099) internal successors, (475), 409 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 475 transitions. [2021-11-06 00:23:34,040 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 475 transitions. Word has length 148 [2021-11-06 00:23:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:34,041 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 475 transitions. [2021-11-06 00:23:34,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 475 transitions. [2021-11-06 00:23:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 00:23:34,042 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:34,042 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:34,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:34,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:34,254 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1997207916, now seen corresponding path program 1 times [2021-11-06 00:23:34,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:34,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235360663] [2021-11-06 00:23:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:34,256 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:34,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:34,257 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:34,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 00:23:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:34,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-06 00:23:34,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 00:23:35,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 00:23:39,307 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:39,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235360663] [2021-11-06 00:23:39,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235360663] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:23:39,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:23:39,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2021-11-06 00:23:39,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622937905] [2021-11-06 00:23:39,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:23:39,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-06 00:23:39,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:39,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-06 00:23:39,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=3099, Unknown=0, NotChecked=0, Total=4032 [2021-11-06 00:23:39,311 INFO L87 Difference]: Start difference. First operand 410 states and 475 transitions. Second operand has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:24:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:24:46,674 INFO L93 Difference]: Finished difference Result 805 states and 961 transitions. [2021-11-06 00:24:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-06 00:24:46,676 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-11-06 00:24:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:24:46,678 INFO L225 Difference]: With dead ends: 805 [2021-11-06 00:24:46,678 INFO L226 Difference]: Without dead ends: 440 [2021-11-06 00:24:46,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 28757.14ms TimeCoverageRelationStatistics Valid=2700, Invalid=6042, Unknown=0, NotChecked=0, Total=8742 [2021-11-06 00:24:46,681 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 6231 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41679.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6439 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.63ms SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42423.93ms IncrementalHoareTripleChecker+Time [2021-11-06 00:24:46,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6439 Invalid, 1623 Unknown, 0 Unchecked, 14.63ms Time], IncrementalHoareTripleChecker [555 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 42423.93ms Time] [2021-11-06 00:24:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-11-06 00:24:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-11-06 00:24:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 438 states have (on average 1.1529680365296804) internal successors, (505), 439 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:24:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 505 transitions. [2021-11-06 00:24:46,709 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 505 transitions. Word has length 148 [2021-11-06 00:24:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:24:46,709 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 505 transitions. [2021-11-06 00:24:46,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:24:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 505 transitions. [2021-11-06 00:24:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-06 00:24:46,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:24:46,711 INFO L514 BasicCegarLoop]: trace histogram [44, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:24:46,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-06 00:24:46,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:24:46,929 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:24:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:24:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843980, now seen corresponding path program 2 times [2021-11-06 00:24:46,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:24:46,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917508148] [2021-11-06 00:24:46,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:24:46,930 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:24:46,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:24:46,931 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:24:46,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 00:24:47,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 00:24:47,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:24:47,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-06 00:24:47,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:24:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:24:48,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:24:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:24:52,637 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:24:52,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917508148] [2021-11-06 00:24:52,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917508148] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:24:52,638 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:24:52,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2021-11-06 00:24:52,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229473479] [2021-11-06 00:24:52,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:24:52,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-06 00:24:52,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:24:52,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-06 00:24:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2021-11-06 00:24:52,639 INFO L87 Difference]: Start difference. First operand 440 states and 505 transitions. Second operand has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:26:05,592 INFO L93 Difference]: Finished difference Result 868 states and 1027 transitions. [2021-11-06 00:26:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-06 00:26:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-11-06 00:26:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:26:05,598 INFO L225 Difference]: With dead ends: 868 [2021-11-06 00:26:05,598 INFO L226 Difference]: Without dead ends: 473 [2021-11-06 00:26:05,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 30138.64ms TimeCoverageRelationStatistics Valid=3199, Invalid=6113, Unknown=0, NotChecked=0, Total=9312 [2021-11-06 00:26:05,601 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 6432 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45953.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6640 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.65ms SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46808.37ms IncrementalHoareTripleChecker+Time [2021-11-06 00:26:05,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6640 Invalid, 1919 Unknown, 0 Unchecked, 14.65ms Time], IncrementalHoareTripleChecker [591 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 46808.37ms Time] [2021-11-06 00:26:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-11-06 00:26:05,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2021-11-06 00:26:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 471 states have (on average 1.1422505307855626) internal successors, (538), 472 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 538 transitions. [2021-11-06 00:26:05,626 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 538 transitions. Word has length 178 [2021-11-06 00:26:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:26:05,626 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 538 transitions. [2021-11-06 00:26:05,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 538 transitions. [2021-11-06 00:26:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-06 00:26:05,629 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:26:05,629 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:26:05,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-06 00:26:05,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:26:05,842 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:26:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:26:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1145284768, now seen corresponding path program 3 times [2021-11-06 00:26:05,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:26:05,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119016967] [2021-11-06 00:26:05,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 00:26:05,843 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:26:05,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:26:05,844 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:26:05,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 00:26:06,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-06 00:26:06,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:26:06,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:26:06,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:26:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 00:26:06,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:26:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 00:26:07,148 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:26:07,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119016967] [2021-11-06 00:26:07,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119016967] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:26:07,148 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:26:07,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 00:26:07,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799871393] [2021-11-06 00:26:07,149 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:26:07,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:26:07,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:26:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:26:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:26:07,149 INFO L87 Difference]: Start difference. First operand 473 states and 538 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:26:08,862 INFO L93 Difference]: Finished difference Result 983 states and 1122 transitions. [2021-11-06 00:26:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:26:08,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2021-11-06 00:26:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:26:08,864 INFO L225 Difference]: With dead ends: 983 [2021-11-06 00:26:08,864 INFO L226 Difference]: Without dead ends: 555 [2021-11-06 00:26:08,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.97ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:26:08,866 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 395 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1563.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.53ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1676.15ms IncrementalHoareTripleChecker+Time [2021-11-06 00:26:08,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 335 Invalid, 83 Unknown, 0 Unchecked, 1.53ms Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 1676.15ms Time] [2021-11-06 00:26:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-06 00:26:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 548. [2021-11-06 00:26:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 546 states have (on average 1.1446886446886446) internal successors, (625), 547 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 625 transitions. [2021-11-06 00:26:08,892 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 625 transitions. Word has length 211 [2021-11-06 00:26:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:26:08,893 INFO L470 AbstractCegarLoop]: Abstraction has 548 states and 625 transitions. [2021-11-06 00:26:08,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 625 transitions. [2021-11-06 00:26:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-06 00:26:08,895 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:26:08,895 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:26:08,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-11-06 00:26:09,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:26:09,110 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:26:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:26:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash 670931834, now seen corresponding path program 1 times [2021-11-06 00:26:09,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:26:09,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765306586] [2021-11-06 00:26:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:26:09,112 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:26:09,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:26:09,113 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:26:09,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-06 00:26:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:26:10,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-06 00:26:10,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:26:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:26:13,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:26:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:26:26,757 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:26:26,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765306586] [2021-11-06 00:26:26,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765306586] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:26:26,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:26:26,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2021-11-06 00:26:26,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590186138] [2021-11-06 00:26:26,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:26:26,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-11-06 00:26:26,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:26:26,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-11-06 00:26:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4486, Invalid=12806, Unknown=0, NotChecked=0, Total=17292 [2021-11-06 00:26:26,763 INFO L87 Difference]: Start difference. First operand 548 states and 625 transitions. Second operand has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:30:24,767 WARN L230 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 193 [2021-11-06 00:30:33,159 WARN L230 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 190 [2021-11-06 00:30:41,166 WARN L230 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 187 [2021-11-06 00:30:48,776 WARN L230 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 184 [2021-11-06 00:32:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:32:34,794 INFO L93 Difference]: Finished difference Result 1003 states and 1217 transitions. [2021-11-06 00:32:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-06 00:32:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2021-11-06 00:32:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:32:34,798 INFO L225 Difference]: With dead ends: 1003 [2021-11-06 00:32:34,798 INFO L226 Difference]: Without dead ends: 614 [2021-11-06 00:32:34,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 255942.80ms TimeCoverageRelationStatistics Valid=12934, Invalid=25286, Unknown=0, NotChecked=0, Total=38220 [2021-11-06 00:32:34,808 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 13065 mSDsCounter, 0 mSdLazyCounter, 4767 mSolverCounterSat, 1119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 123983.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13273 SdHoareTripleChecker+Invalid, 5886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 36.57ms SdHoareTripleChecker+Time, 1119 IncrementalHoareTripleChecker+Valid, 4767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126982.70ms IncrementalHoareTripleChecker+Time [2021-11-06 00:32:34,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13273 Invalid, 5886 Unknown, 0 Unchecked, 36.57ms Time], IncrementalHoareTripleChecker [1119 Valid, 4767 Invalid, 0 Unknown, 0 Unchecked, 126982.70ms Time] [2021-11-06 00:32:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-11-06 00:32:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-11-06 00:32:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 612 states have (on average 1.1290849673202614) internal successors, (691), 613 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:32:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2021-11-06 00:32:34,850 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 218 [2021-11-06 00:32:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:32:34,850 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2021-11-06 00:32:34,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:32:34,856 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2021-11-06 00:32:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-11-06 00:32:34,859 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:32:34,859 INFO L514 BasicCegarLoop]: trace histogram [130, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:32:34,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-06 00:32:35,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:32:35,075 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:32:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:32:35,076 INFO L85 PathProgramCache]: Analyzing trace with hash 249759226, now seen corresponding path program 2 times [2021-11-06 00:32:35,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:32:35,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659568740] [2021-11-06 00:32:35,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:32:35,077 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:32:35,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:32:35,078 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:32:35,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-06 00:32:36,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 00:32:36,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:32:36,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 133 conjunts are in the unsatisfiable core [2021-11-06 00:32:36,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:32:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:32:47,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:33:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:33:42,413 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:33:42,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659568740] [2021-11-06 00:33:42,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659568740] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:33:42,414 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:33:42,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 264 [2021-11-06 00:33:42,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039129000] [2021-11-06 00:33:42,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:33:42,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 264 states [2021-11-06 00:33:42,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:33:42,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 264 interpolants. [2021-11-06 00:33:42,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17686, Invalid=51746, Unknown=0, NotChecked=0, Total=69432 [2021-11-06 00:33:42,425 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 264 states, 264 states have (on average 1.4128787878787878) internal successors, (373), 264 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Killed by 15