./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 21:44:42,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 21:44:42,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 21:44:42,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 21:44:42,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 21:44:42,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 21:44:42,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 21:44:42,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 21:44:42,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 21:44:42,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 21:44:42,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 21:44:42,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 21:44:42,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 21:44:42,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 21:44:42,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 21:44:42,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 21:44:42,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 21:44:42,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 21:44:42,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 21:44:42,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 21:44:42,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 21:44:42,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 21:44:42,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 21:44:42,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 21:44:42,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 21:44:42,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 21:44:42,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 21:44:42,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 21:44:42,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 21:44:42,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 21:44:42,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 21:44:42,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 21:44:42,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 21:44:42,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 21:44:42,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 21:44:42,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 21:44:42,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 21:44:42,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 21:44:42,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 21:44:42,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 21:44:42,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 21:44:42,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 21:44:42,632 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 21:44:42,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 21:44:42,633 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 21:44:42,633 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 21:44:42,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 21:44:42,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 21:44:42,634 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 21:44:42,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 21:44:42,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 21:44:42,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 21:44:42,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 21:44:42,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 21:44:42,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 21:44:42,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 21:44:42,652 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 21:44:42,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 21:44:42,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 21:44:42,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 21:44:42,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 21:44:42,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:44:42,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 21:44:42,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 21:44:42,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 21:44:42,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 21:44:42,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 21:44:42,654 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 21:44:42,654 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 21:44:42,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 21:44:42,655 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 21:44:42,655 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2021-11-22 21:44:42,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 21:44:42,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 21:44:42,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 21:44:42,886 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 21:44:42,887 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 21:44:42,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-22 21:44:42,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8d28a58/d4156764a11148cc950f7df9db026d49/FLAGe51bf9b6f [2021-11-22 21:44:43,478 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 21:44:43,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-22 21:44:43,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8d28a58/d4156764a11148cc950f7df9db026d49/FLAGe51bf9b6f [2021-11-22 21:44:43,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8d28a58/d4156764a11148cc950f7df9db026d49 [2021-11-22 21:44:43,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 21:44:43,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 21:44:43,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 21:44:43,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 21:44:43,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 21:44:43,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:43" (1/1) ... [2021-11-22 21:44:43,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea012ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:43, skipping insertion in model container [2021-11-22 21:44:43,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:43" (1/1) ... [2021-11-22 21:44:43,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 21:44:43,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:44:44,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-22 21:44:44,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:44:44,716 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 21:44:44,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-22 21:44:44,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:44:44,940 INFO L208 MainTranslator]: Completed translation [2021-11-22 21:44:44,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44 WrapperNode [2021-11-22 21:44:44,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 21:44:44,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 21:44:44,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 21:44:44,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 21:44:44,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:44,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:45,126 INFO L137 Inliner]: procedures = 157, calls = 812, calls flagged for inlining = 287, calls inlined = 486, statements flattened = 5810 [2021-11-22 21:44:45,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 21:44:45,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 21:44:45,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 21:44:45,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 21:44:45,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:45,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:45,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:45,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:45,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:45,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:45,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:45,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 21:44:45,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 21:44:45,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 21:44:45,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 21:44:45,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (1/1) ... [2021-11-22 21:44:45,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:44:45,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 21:44:45,380 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-22 21:44:45,398 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-22 21:44:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-22 21:44:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-22 21:44:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-22 21:44:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 21:44:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 21:44:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 21:44:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 21:44:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 21:44:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 21:44:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 21:44:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-22 21:44:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 21:44:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 21:44:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 21:44:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 21:44:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-22 21:44:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 21:44:45,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 21:44:45,786 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 21:44:45,787 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 21:44:48,184 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 21:44:48,195 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 21:44:48,195 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 21:44:48,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:48 BoogieIcfgContainer [2021-11-22 21:44:48,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 21:44:48,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 21:44:48,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 21:44:48,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 21:44:48,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:44:43" (1/3) ... [2021-11-22 21:44:48,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6583776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:48, skipping insertion in model container [2021-11-22 21:44:48,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:44" (2/3) ... [2021-11-22 21:44:48,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6583776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:48, skipping insertion in model container [2021-11-22 21:44:48,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:48" (3/3) ... [2021-11-22 21:44:48,204 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-22 21:44:48,207 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 21:44:48,208 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-22 21:44:48,244 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 21:44:48,249 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-22 21:44:48,249 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-22 21:44:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 1168 states, 1166 states have (on average 1.4408233276157805) internal successors, (1680), 1167 states have internal predecessors, (1680), 0 states have call successors, (0), 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-22 21:44:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 21:44:48,279 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:48,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:48,280 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:48,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash -32637876, now seen corresponding path program 1 times [2021-11-22 21:44:48,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:48,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982275917] [2021-11-22 21:44:48,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:48,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:48,479 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-22 21:44:48,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982275917] [2021-11-22 21:44:48,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982275917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:48,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:48,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 21:44:48,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981094046] [2021-11-22 21:44:48,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:48,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:48,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:48,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:48,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:48,509 INFO L87 Difference]: Start difference. First operand has 1168 states, 1166 states have (on average 1.4408233276157805) internal successors, (1680), 1167 states have internal predecessors, (1680), 0 states have call successors, (0), 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 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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-22 21:44:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:48,651 INFO L93 Difference]: Finished difference Result 2330 states and 3352 transitions. [2021-11-22 21:44:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:48,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-22 21:44:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:48,682 INFO L225 Difference]: With dead ends: 2330 [2021-11-22 21:44:48,682 INFO L226 Difference]: Without dead ends: 1129 [2021-11-22 21:44:48,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:48,691 INFO L933 BasicCegarLoop]: 1653 mSDtfsCounter, 1658 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:48,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1658 Valid, 1653 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-11-22 21:44:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2021-11-22 21:44:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.427304964539007) internal successors, (1610), 1128 states have internal predecessors, (1610), 0 states have call successors, (0), 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-22 21:44:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1610 transitions. [2021-11-22 21:44:48,764 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1610 transitions. Word has length 37 [2021-11-22 21:44:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:48,765 INFO L470 AbstractCegarLoop]: Abstraction has 1129 states and 1610 transitions. [2021-11-22 21:44:48,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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-22 21:44:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1610 transitions. [2021-11-22 21:44:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 21:44:48,767 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:48,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:48,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 21:44:48,768 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:48,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash -10005622, now seen corresponding path program 1 times [2021-11-22 21:44:48,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:48,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381301248] [2021-11-22 21:44:48,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:48,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:48,844 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-22 21:44:48,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:48,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381301248] [2021-11-22 21:44:48,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381301248] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:48,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:48,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 21:44:48,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903843451] [2021-11-22 21:44:48,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:48,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:44:48,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:48,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:44:48,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:48,847 INFO L87 Difference]: Start difference. First operand 1129 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-22 21:44:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:48,904 INFO L93 Difference]: Finished difference Result 2233 states and 3191 transitions. [2021-11-22 21:44:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:44:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-22 21:44:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:48,908 INFO L225 Difference]: With dead ends: 2233 [2021-11-22 21:44:48,908 INFO L226 Difference]: Without dead ends: 1129 [2021-11-22 21:44:48,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:44:48,911 INFO L933 BasicCegarLoop]: 1609 mSDtfsCounter, 1 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4822 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:48,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 4822 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-11-22 21:44:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2021-11-22 21:44:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.426418439716312) internal successors, (1609), 1128 states have internal predecessors, (1609), 0 states have call successors, (0), 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-22 21:44:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1609 transitions. [2021-11-22 21:44:48,931 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1609 transitions. Word has length 37 [2021-11-22 21:44:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:48,931 INFO L470 AbstractCegarLoop]: Abstraction has 1129 states and 1609 transitions. [2021-11-22 21:44:48,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-22 21:44:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1609 transitions. [2021-11-22 21:44:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 21:44:48,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:48,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:48,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 21:44:48,933 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1490205746, now seen corresponding path program 1 times [2021-11-22 21:44:48,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:48,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342057780] [2021-11-22 21:44:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:48,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:48,997 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-22 21:44:48,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:48,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342057780] [2021-11-22 21:44:48,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342057780] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:48,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:48,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 21:44:48,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223265694] [2021-11-22 21:44:48,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:48,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:44:48,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:49,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:44:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:49,000 INFO L87 Difference]: Start difference. First operand 1129 states and 1609 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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-22 21:44:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:49,077 INFO L93 Difference]: Finished difference Result 2233 states and 3190 transitions. [2021-11-22 21:44:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:44:49,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-11-22 21:44:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:49,085 INFO L225 Difference]: With dead ends: 2233 [2021-11-22 21:44:49,086 INFO L226 Difference]: Without dead ends: 2231 [2021-11-22 21:44:49,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:44:49,088 INFO L933 BasicCegarLoop]: 3178 mSDtfsCounter, 2883 mSDsluCounter, 3474 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 6652 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:49,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2883 Valid, 6652 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-11-22 21:44:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1131. [2021-11-22 21:44:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.4256637168141593) internal successors, (1611), 1130 states have internal predecessors, (1611), 0 states have call successors, (0), 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-22 21:44:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1611 transitions. [2021-11-22 21:44:49,125 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1611 transitions. Word has length 40 [2021-11-22 21:44:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:49,125 INFO L470 AbstractCegarLoop]: Abstraction has 1131 states and 1611 transitions. [2021-11-22 21:44:49,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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-22 21:44:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1611 transitions. [2021-11-22 21:44:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 21:44:49,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:49,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:49,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 21:44:49,128 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash 297088485, now seen corresponding path program 1 times [2021-11-22 21:44:49,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:49,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661060960] [2021-11-22 21:44:49,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:49,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:49,197 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-22 21:44:49,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:49,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661060960] [2021-11-22 21:44:49,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661060960] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:49,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:49,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:44:49,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824333684] [2021-11-22 21:44:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:49,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:44:49,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:49,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:44:49,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:49,200 INFO L87 Difference]: Start difference. First operand 1131 states and 1611 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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-22 21:44:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:49,337 INFO L93 Difference]: Finished difference Result 3339 states and 4773 transitions. [2021-11-22 21:44:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:44:49,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-11-22 21:44:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:49,345 INFO L225 Difference]: With dead ends: 3339 [2021-11-22 21:44:49,345 INFO L226 Difference]: Without dead ends: 2235 [2021-11-22 21:44:49,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:49,348 INFO L933 BasicCegarLoop]: 2913 mSDtfsCounter, 3410 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3410 SdHoareTripleChecker+Valid, 4510 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:49,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3410 Valid, 4510 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2021-11-22 21:44:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 1132. [2021-11-22 21:44:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.4252873563218391) internal successors, (1612), 1131 states have internal predecessors, (1612), 0 states have call successors, (0), 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-22 21:44:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1612 transitions. [2021-11-22 21:44:49,396 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1612 transitions. Word has length 48 [2021-11-22 21:44:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:49,397 INFO L470 AbstractCegarLoop]: Abstraction has 1132 states and 1612 transitions. [2021-11-22 21:44:49,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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-22 21:44:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1612 transitions. [2021-11-22 21:44:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-22 21:44:49,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:49,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:49,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 21:44:49,399 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:49,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1976968646, now seen corresponding path program 1 times [2021-11-22 21:44:49,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:49,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255884071] [2021-11-22 21:44:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:49,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:49,447 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-22 21:44:49,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:49,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255884071] [2021-11-22 21:44:49,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255884071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:49,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:49,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:44:49,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882535795] [2021-11-22 21:44:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:49,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:49,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:49,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:49,450 INFO L87 Difference]: Start difference. First operand 1132 states and 1612 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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-22 21:44:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:49,499 INFO L93 Difference]: Finished difference Result 2238 states and 3196 transitions. [2021-11-22 21:44:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:49,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-11-22 21:44:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:49,503 INFO L225 Difference]: With dead ends: 2238 [2021-11-22 21:44:49,503 INFO L226 Difference]: Without dead ends: 1133 [2021-11-22 21:44:49,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:49,506 INFO L933 BasicCegarLoop]: 1608 mSDtfsCounter, 0 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3211 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:49,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3211 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-11-22 21:44:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2021-11-22 21:44:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.424911660777385) internal successors, (1613), 1132 states have internal predecessors, (1613), 0 states have call successors, (0), 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-22 21:44:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1613 transitions. [2021-11-22 21:44:49,545 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1613 transitions. Word has length 50 [2021-11-22 21:44:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:49,545 INFO L470 AbstractCegarLoop]: Abstraction has 1133 states and 1613 transitions. [2021-11-22 21:44:49,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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-22 21:44:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1613 transitions. [2021-11-22 21:44:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-22 21:44:49,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:49,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:49,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 21:44:49,547 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:49,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash 201961284, now seen corresponding path program 1 times [2021-11-22 21:44:49,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:49,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085947455] [2021-11-22 21:44:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:49,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:49,602 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-22 21:44:49,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:49,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085947455] [2021-11-22 21:44:49,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085947455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:49,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:49,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 21:44:49,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926686022] [2021-11-22 21:44:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:49,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 21:44:49,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:49,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 21:44:49,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:44:49,605 INFO L87 Difference]: Start difference. First operand 1133 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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-22 21:44:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:49,835 INFO L93 Difference]: Finished difference Result 4086 states and 5841 transitions. [2021-11-22 21:44:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 21:44:49,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-11-22 21:44:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:49,847 INFO L225 Difference]: With dead ends: 4086 [2021-11-22 21:44:49,848 INFO L226 Difference]: Without dead ends: 4084 [2021-11-22 21:44:49,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 21:44:49,850 INFO L933 BasicCegarLoop]: 4489 mSDtfsCounter, 5688 mSDsluCounter, 8914 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5688 SdHoareTripleChecker+Valid, 13403 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:49,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5688 Valid, 13403 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4084 states. [2021-11-22 21:44:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4084 to 1135. [2021-11-22 21:44:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 1.4241622574955908) internal successors, (1615), 1134 states have internal predecessors, (1615), 0 states have call successors, (0), 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-22 21:44:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1615 transitions. [2021-11-22 21:44:49,902 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1615 transitions. Word has length 50 [2021-11-22 21:44:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:49,903 INFO L470 AbstractCegarLoop]: Abstraction has 1135 states and 1615 transitions. [2021-11-22 21:44:49,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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-22 21:44:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1615 transitions. [2021-11-22 21:44:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 21:44:49,904 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:49,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:49,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 21:44:49,905 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 406157341, now seen corresponding path program 1 times [2021-11-22 21:44:49,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:49,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823236071] [2021-11-22 21:44:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:49,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:49,964 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-22 21:44:49,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:49,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823236071] [2021-11-22 21:44:49,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823236071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:49,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:49,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:44:49,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812518491] [2021-11-22 21:44:49,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:49,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:49,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:49,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:49,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:49,966 INFO L87 Difference]: Start difference. First operand 1135 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:50,051 INFO L93 Difference]: Finished difference Result 2243 states and 3200 transitions. [2021-11-22 21:44:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:50,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 21:44:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:50,056 INFO L225 Difference]: With dead ends: 2243 [2021-11-22 21:44:50,056 INFO L226 Difference]: Without dead ends: 1135 [2021-11-22 21:44:50,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:50,058 INFO L933 BasicCegarLoop]: 1593 mSDtfsCounter, 1554 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:50,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1554 Valid, 1613 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2021-11-22 21:44:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2021-11-22 21:44:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 1.4232804232804233) internal successors, (1614), 1134 states have internal predecessors, (1614), 0 states have call successors, (0), 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-22 21:44:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1614 transitions. [2021-11-22 21:44:50,101 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1614 transitions. Word has length 64 [2021-11-22 21:44:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:50,102 INFO L470 AbstractCegarLoop]: Abstraction has 1135 states and 1614 transitions. [2021-11-22 21:44:50,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1614 transitions. [2021-11-22 21:44:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 21:44:50,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:50,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:50,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 21:44:50,104 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1029952425, now seen corresponding path program 1 times [2021-11-22 21:44:50,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:50,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768947192] [2021-11-22 21:44:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:50,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:50,165 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-22 21:44:50,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:50,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768947192] [2021-11-22 21:44:50,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768947192] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:50,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:50,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:44:50,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579408041] [2021-11-22 21:44:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:50,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:44:50,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:44:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:50,168 INFO L87 Difference]: Start difference. First operand 1135 states and 1614 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-22 21:44:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:50,308 INFO L93 Difference]: Finished difference Result 3350 states and 4781 transitions. [2021-11-22 21:44:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:44:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-22 21:44:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:50,316 INFO L225 Difference]: With dead ends: 3350 [2021-11-22 21:44:50,316 INFO L226 Difference]: Without dead ends: 2242 [2021-11-22 21:44:50,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:50,319 INFO L933 BasicCegarLoop]: 3138 mSDtfsCounter, 3164 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3164 SdHoareTripleChecker+Valid, 4730 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:50,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3164 Valid, 4730 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2021-11-22 21:44:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1139. [2021-11-22 21:44:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.422671353251318) internal successors, (1619), 1138 states have internal predecessors, (1619), 0 states have call successors, (0), 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-22 21:44:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1619 transitions. [2021-11-22 21:44:50,421 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1619 transitions. Word has length 66 [2021-11-22 21:44:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:50,422 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 1619 transitions. [2021-11-22 21:44:50,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-22 21:44:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1619 transitions. [2021-11-22 21:44:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 21:44:50,426 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:50,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:50,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 21:44:50,427 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:50,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1319991024, now seen corresponding path program 1 times [2021-11-22 21:44:50,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:50,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052862902] [2021-11-22 21:44:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:50,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 21:44:50,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:50,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052862902] [2021-11-22 21:44:50,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052862902] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:50,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:50,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:44:50,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353722778] [2021-11-22 21:44:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:50,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:50,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:50,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:50,508 INFO L87 Difference]: Start difference. First operand 1139 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-22 21:44:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:50,644 INFO L93 Difference]: Finished difference Result 2260 states and 3217 transitions. [2021-11-22 21:44:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-22 21:44:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:50,648 INFO L225 Difference]: With dead ends: 2260 [2021-11-22 21:44:50,648 INFO L226 Difference]: Without dead ends: 1148 [2021-11-22 21:44:50,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:50,650 INFO L933 BasicCegarLoop]: 1561 mSDtfsCounter, 0 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:50,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3061 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:44:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2021-11-22 21:44:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1139. [2021-11-22 21:44:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.398945518453427) internal successors, (1592), 1138 states have internal predecessors, (1592), 0 states have call successors, (0), 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-22 21:44:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1592 transitions. [2021-11-22 21:44:50,696 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1592 transitions. Word has length 69 [2021-11-22 21:44:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:50,697 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 1592 transitions. [2021-11-22 21:44:50,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-22 21:44:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1592 transitions. [2021-11-22 21:44:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 21:44:50,699 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:50,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:50,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 21:44:50,699 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:50,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1400961988, now seen corresponding path program 1 times [2021-11-22 21:44:50,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:50,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823131478] [2021-11-22 21:44:50,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:50,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:50,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:50,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823131478] [2021-11-22 21:44:50,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823131478] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 21:44:50,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70850991] [2021-11-22 21:44:50,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:50,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 21:44:50,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 21:44:50,802 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-22 21:44:50,803 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-22 21:44:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:51,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 21:44:51,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:44:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:51,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:44:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:44:51,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70850991] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 21:44:51,485 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 21:44:51,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-22 21:44:51,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367016671] [2021-11-22 21:44:51,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 21:44:51,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 21:44:51,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:51,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 21:44:51,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-11-22 21:44:51,486 INFO L87 Difference]: Start difference. First operand 1139 states and 1592 transitions. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 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-22 21:44:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:51,958 INFO L93 Difference]: Finished difference Result 6653 states and 9343 transitions. [2021-11-22 21:44:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 21:44:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 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-22 21:44:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:51,974 INFO L225 Difference]: With dead ends: 6653 [2021-11-22 21:44:51,975 INFO L226 Difference]: Without dead ends: 5541 [2021-11-22 21:44:51,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-11-22 21:44:51,978 INFO L933 BasicCegarLoop]: 2878 mSDtfsCounter, 11078 mSDsluCounter, 10572 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11078 SdHoareTripleChecker+Valid, 13450 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:51,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11078 Valid, 13450 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:44:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5541 states. [2021-11-22 21:44:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5541 to 1146. [2021-11-22 21:44:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.3982532751091703) internal successors, (1601), 1145 states have internal predecessors, (1601), 0 states have call successors, (0), 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-22 21:44:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1601 transitions. [2021-11-22 21:44:52,050 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1601 transitions. Word has length 72 [2021-11-22 21:44:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:52,050 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 1601 transitions. [2021-11-22 21:44:52,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 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-22 21:44:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1601 transitions. [2021-11-22 21:44:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 21:44:52,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:52,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:52,074 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-22 21:44:52,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-22 21:44:52,268 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1577013695, now seen corresponding path program 1 times [2021-11-22 21:44:52,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:52,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270344758] [2021-11-22 21:44:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:52,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:52,418 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-22 21:44:52,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:52,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270344758] [2021-11-22 21:44:52,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270344758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:52,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:52,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 21:44:52,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508607585] [2021-11-22 21:44:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:52,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 21:44:52,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:52,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 21:44:52,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:44:52,420 INFO L87 Difference]: Start difference. First operand 1146 states and 1601 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-22 21:44:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:52,971 INFO L93 Difference]: Finished difference Result 5399 states and 7579 transitions. [2021-11-22 21:44:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 21:44:52,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-11-22 21:44:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:52,984 INFO L225 Difference]: With dead ends: 5399 [2021-11-22 21:44:52,984 INFO L226 Difference]: Without dead ends: 4269 [2021-11-22 21:44:52,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-22 21:44:52,987 INFO L933 BasicCegarLoop]: 2962 mSDtfsCounter, 8558 mSDsluCounter, 14424 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8558 SdHoareTripleChecker+Valid, 17386 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:52,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8558 Valid, 17386 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:44:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states. [2021-11-22 21:44:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 1146. [2021-11-22 21:44:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.3973799126637554) internal successors, (1600), 1145 states have internal predecessors, (1600), 0 states have call successors, (0), 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-22 21:44:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1600 transitions. [2021-11-22 21:44:53,062 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1600 transitions. Word has length 77 [2021-11-22 21:44:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:53,062 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 1600 transitions. [2021-11-22 21:44:53,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-22 21:44:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1600 transitions. [2021-11-22 21:44:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 21:44:53,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:53,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:53,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 21:44:53,064 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2097814622, now seen corresponding path program 1 times [2021-11-22 21:44:53,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:53,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879722278] [2021-11-22 21:44:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:53,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:53,144 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-22 21:44:53,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:53,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879722278] [2021-11-22 21:44:53,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879722278] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:53,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:53,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 21:44:53,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731511342] [2021-11-22 21:44:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:53,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:44:53,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:44:53,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:53,145 INFO L87 Difference]: Start difference. First operand 1146 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-22 21:44:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:53,368 INFO L93 Difference]: Finished difference Result 4112 states and 5774 transitions. [2021-11-22 21:44:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:44:53,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-22 21:44:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:53,374 INFO L225 Difference]: With dead ends: 4112 [2021-11-22 21:44:53,374 INFO L226 Difference]: Without dead ends: 2993 [2021-11-22 21:44:53,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:44:53,376 INFO L933 BasicCegarLoop]: 2890 mSDtfsCounter, 3885 mSDsluCounter, 4446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3885 SdHoareTripleChecker+Valid, 7336 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:53,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3885 Valid, 7336 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2021-11-22 21:44:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1148. [2021-11-22 21:44:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.3966870095902355) internal successors, (1602), 1147 states have internal predecessors, (1602), 0 states have call successors, (0), 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-22 21:44:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1602 transitions. [2021-11-22 21:44:53,450 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1602 transitions. Word has length 80 [2021-11-22 21:44:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:53,450 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 1602 transitions. [2021-11-22 21:44:53,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-22 21:44:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1602 transitions. [2021-11-22 21:44:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 21:44:53,452 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:53,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:53,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 21:44:53,452 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:53,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash -836234308, now seen corresponding path program 1 times [2021-11-22 21:44:53,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:53,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461742193] [2021-11-22 21:44:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:53,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:53,500 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-22 21:44:53,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:53,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461742193] [2021-11-22 21:44:53,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461742193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:53,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:53,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:44:53,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437462478] [2021-11-22 21:44:53,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:53,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:44:53,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:53,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:44:53,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:53,502 INFO L87 Difference]: Start difference. First operand 1148 states and 1602 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-22 21:44:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:53,667 INFO L93 Difference]: Finished difference Result 3205 states and 4495 transitions. [2021-11-22 21:44:53,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:44:53,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-11-22 21:44:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:53,672 INFO L225 Difference]: With dead ends: 3205 [2021-11-22 21:44:53,672 INFO L226 Difference]: Without dead ends: 2084 [2021-11-22 21:44:53,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:44:53,674 INFO L933 BasicCegarLoop]: 2890 mSDtfsCounter, 1322 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 4447 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:53,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1322 Valid, 4447 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:44:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2021-11-22 21:44:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1150. [2021-11-22 21:44:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.3959965187119234) internal successors, (1604), 1149 states have internal predecessors, (1604), 0 states have call successors, (0), 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-22 21:44:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1604 transitions. [2021-11-22 21:44:53,782 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1604 transitions. Word has length 82 [2021-11-22 21:44:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:53,782 INFO L470 AbstractCegarLoop]: Abstraction has 1150 states and 1604 transitions. [2021-11-22 21:44:53,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-22 21:44:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1604 transitions. [2021-11-22 21:44:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-22 21:44:53,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:53,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:53,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 21:44:53,784 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash 193076202, now seen corresponding path program 1 times [2021-11-22 21:44:53,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:53,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837639221] [2021-11-22 21:44:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:53,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:53,870 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-22 21:44:53,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:53,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837639221] [2021-11-22 21:44:53,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837639221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:53,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:53,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 21:44:53,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20249356] [2021-11-22 21:44:53,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:53,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 21:44:53,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:53,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 21:44:53,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:44:53,871 INFO L87 Difference]: Start difference. First operand 1150 states and 1604 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-22 21:44:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:54,510 INFO L93 Difference]: Finished difference Result 7416 states and 10415 transitions. [2021-11-22 21:44:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 21:44:54,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-11-22 21:44:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:54,521 INFO L225 Difference]: With dead ends: 7416 [2021-11-22 21:44:54,521 INFO L226 Difference]: Without dead ends: 6293 [2021-11-22 21:44:54,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 21:44:54,523 INFO L933 BasicCegarLoop]: 4330 mSDtfsCounter, 9761 mSDsluCounter, 10144 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9761 SdHoareTripleChecker+Valid, 14474 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:54,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9761 Valid, 14474 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:44:54,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6293 states. [2021-11-22 21:44:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6293 to 1153. [2021-11-22 21:44:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.3949652777777777) internal successors, (1607), 1152 states have internal predecessors, (1607), 0 states have call successors, (0), 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-22 21:44:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1607 transitions. [2021-11-22 21:44:54,628 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1607 transitions. Word has length 86 [2021-11-22 21:44:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:54,628 INFO L470 AbstractCegarLoop]: Abstraction has 1153 states and 1607 transitions. [2021-11-22 21:44:54,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-22 21:44:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1607 transitions. [2021-11-22 21:44:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-22 21:44:54,630 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:54,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:44:54,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 21:44:54,630 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:44:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash 606169085, now seen corresponding path program 1 times [2021-11-22 21:44:54,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:44:54,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114777204] [2021-11-22 21:44:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:54,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:44:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:55,608 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-22 21:44:55,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:44:55,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114777204] [2021-11-22 21:44:55,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114777204] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:55,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:55,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-11-22 21:44:55,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596546585] [2021-11-22 21:44:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:55,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-22 21:44:55,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:44:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-22 21:44:55,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2021-11-22 21:44:55,610 INFO L87 Difference]: Start difference. First operand 1153 states and 1607 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 0 states have call successors, (0), 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-22 21:44:57,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:44:59,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:11,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:14,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:18,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:23,454 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:25,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:27,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:29,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:31,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:35,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:37,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:39,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:43,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:48,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:50,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:53,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:57,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:45:59,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:01,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:02,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:04,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:06,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:08,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:11,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:15,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:18,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:20,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:22,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:24,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:34,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:36,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:38,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:40,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:46:42,058 INFO L93 Difference]: Finished difference Result 25907 states and 37260 transitions. [2021-11-22 21:46:42,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-11-22 21:46:42,058 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-11-22 21:46:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:46:42,124 INFO L225 Difference]: With dead ends: 25907 [2021-11-22 21:46:42,125 INFO L226 Difference]: Without dead ends: 25905 [2021-11-22 21:46:42,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9572 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3604, Invalid=24118, Unknown=0, NotChecked=0, Total=27722 [2021-11-22 21:46:42,136 INFO L933 BasicCegarLoop]: 9064 mSDtfsCounter, 68357 mSDsluCounter, 161207 mSDsCounter, 0 mSdLazyCounter, 18208 mSolverCounterSat, 569 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68357 SdHoareTripleChecker+Valid, 170271 SdHoareTripleChecker+Invalid, 18795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 18208 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:46:42,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68357 Valid, 170271 Invalid, 18795 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [569 Valid, 18208 Invalid, 18 Unknown, 0 Unchecked, 93.1s Time] [2021-11-22 21:46:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25905 states. [2021-11-22 21:46:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25905 to 1899. [2021-11-22 21:46:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1898 states have (on average 1.3962065331928346) internal successors, (2650), 1898 states have internal predecessors, (2650), 0 states have call successors, (0), 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-22 21:46:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2650 transitions. [2021-11-22 21:46:42,510 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2650 transitions. Word has length 89 [2021-11-22 21:46:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:46:42,511 INFO L470 AbstractCegarLoop]: Abstraction has 1899 states and 2650 transitions. [2021-11-22 21:46:42,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 0 states have call successors, (0), 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-22 21:46:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2650 transitions. [2021-11-22 21:46:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 21:46:42,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:46:42,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:46:42,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 21:46:42,514 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:46:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:46:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash -110828916, now seen corresponding path program 1 times [2021-11-22 21:46:42,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:46:42,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207520097] [2021-11-22 21:46:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:46:42,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:46:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:46:43,374 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-22 21:46:43,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:46:43,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207520097] [2021-11-22 21:46:43,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207520097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:46:43,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:46:43,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-11-22 21:46:43,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646691632] [2021-11-22 21:46:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:46:43,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-22 21:46:43,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:46:43,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-22 21:46:43,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2021-11-22 21:46:43,375 INFO L87 Difference]: Start difference. First operand 1899 states and 2650 transitions. Second operand has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 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-22 21:46:46,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:48,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:52,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:54,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:04,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:06,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:12,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:15,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:17,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:19,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:21,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:23,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:24,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:27,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:35,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:37,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:39,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:41,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:43,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:45,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:48,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:50,046 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:47:58,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:03,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:08,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:09,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:11,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:13,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:15,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:16,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:22,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:24,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:27,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:29,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:32,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:37,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:39,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:42,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:47,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:50,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:48:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:48:52,863 INFO L93 Difference]: Finished difference Result 25927 states and 37282 transitions. [2021-11-22 21:48:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-11-22 21:48:52,864 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-11-22 21:48:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:48:53,074 INFO L225 Difference]: With dead ends: 25927 [2021-11-22 21:48:53,091 INFO L226 Difference]: Without dead ends: 25925 [2021-11-22 21:48:53,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9447 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3581, Invalid=23809, Unknown=0, NotChecked=0, Total=27390 [2021-11-22 21:48:53,120 INFO L933 BasicCegarLoop]: 9064 mSDtfsCounter, 64037 mSDsluCounter, 149650 mSDsCounter, 0 mSdLazyCounter, 18211 mSolverCounterSat, 547 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64037 SdHoareTripleChecker+Valid, 158714 SdHoareTripleChecker+Invalid, 18786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 18211 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 114.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:48:53,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64037 Valid, 158714 Invalid, 18786 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [547 Valid, 18211 Invalid, 28 Unknown, 0 Unchecked, 114.0s Time] [2021-11-22 21:48:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25925 states. [2021-11-22 21:48:53,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25925 to 1900. [2021-11-22 21:48:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1899 states have (on average 1.3959978936282254) internal successors, (2651), 1899 states have internal predecessors, (2651), 0 states have call successors, (0), 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-22 21:48:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2651 transitions. [2021-11-22 21:48:53,634 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2651 transitions. Word has length 90 [2021-11-22 21:48:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:48:53,635 INFO L470 AbstractCegarLoop]: Abstraction has 1900 states and 2651 transitions. [2021-11-22 21:48:53,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 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-22 21:48:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2651 transitions. [2021-11-22 21:48:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 21:48:53,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:48:53,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:48:53,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 21:48:53,640 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:48:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:48:53,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2059119983, now seen corresponding path program 1 times [2021-11-22 21:48:53,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:48:53,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889423213] [2021-11-22 21:48:53,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:48:53,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:48:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:48:54,612 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-22 21:48:54,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:48:54,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889423213] [2021-11-22 21:48:54,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889423213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:48:54,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:48:54,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-11-22 21:48:54,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624878466] [2021-11-22 21:48:54,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:48:54,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-22 21:48:54,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:48:54,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-22 21:48:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2021-11-22 21:48:54,614 INFO L87 Difference]: Start difference. First operand 1900 states and 2651 transitions. Second operand has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 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-22 21:48:58,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:04,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:11,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:13,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:15,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:17,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:23,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:25,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:28,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:30,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:32,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:34,889 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:36,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:39,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:45,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:47,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:49,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:51,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:54,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:49:56,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:00,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:02,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:07,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:09,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:12,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:14,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:16,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:19,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:22,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:24,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:27,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:31,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:33,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:36,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:38,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:40,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:47,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:51,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:53,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:50:55,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:03,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:05,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:51:09,597 INFO L93 Difference]: Finished difference Result 32672 states and 47113 transitions. [2021-11-22 21:51:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2021-11-22 21:51:09,597 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-11-22 21:51:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:51:09,672 INFO L225 Difference]: With dead ends: 32672 [2021-11-22 21:51:09,672 INFO L226 Difference]: Without dead ends: 32670 [2021-11-22 21:51:09,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11655 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=4085, Invalid=28495, Unknown=0, NotChecked=0, Total=32580 [2021-11-22 21:51:09,688 INFO L933 BasicCegarLoop]: 9054 mSDtfsCounter, 78176 mSDsluCounter, 158325 mSDsCounter, 0 mSdLazyCounter, 19183 mSolverCounterSat, 691 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 111.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78176 SdHoareTripleChecker+Valid, 167379 SdHoareTripleChecker+Invalid, 19901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 691 IncrementalHoareTripleChecker+Valid, 19183 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 115.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:51:09,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78176 Valid, 167379 Invalid, 19901 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [691 Valid, 19183 Invalid, 27 Unknown, 0 Unchecked, 115.0s Time] [2021-11-22 21:51:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32670 states. [2021-11-22 21:51:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32670 to 1903. [2021-11-22 21:51:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1902 states have (on average 1.3958990536277602) internal successors, (2655), 1902 states have internal predecessors, (2655), 0 states have call successors, (0), 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-22 21:51:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2655 transitions. [2021-11-22 21:51:10,290 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2655 transitions. Word has length 90 [2021-11-22 21:51:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:51:10,291 INFO L470 AbstractCegarLoop]: Abstraction has 1903 states and 2655 transitions. [2021-11-22 21:51:10,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 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-22 21:51:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2655 transitions. [2021-11-22 21:51:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 21:51:10,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:51:10,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:51:10,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 21:51:10,296 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:51:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:51:10,297 INFO L85 PathProgramCache]: Analyzing trace with hash -424152476, now seen corresponding path program 1 times [2021-11-22 21:51:10,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:51:10,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971919715] [2021-11-22 21:51:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:51:10,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:51:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:51:10,421 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-22 21:51:10,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:51:10,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971919715] [2021-11-22 21:51:10,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971919715] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:51:10,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:51:10,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 21:51:10,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17993881] [2021-11-22 21:51:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:51:10,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 21:51:10,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:51:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 21:51:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:51:10,423 INFO L87 Difference]: Start difference. First operand 1903 states and 2655 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-22 21:51:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:51:10,964 INFO L93 Difference]: Finished difference Result 3029 states and 4233 transitions. [2021-11-22 21:51:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:51:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-11-22 21:51:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:51:10,967 INFO L225 Difference]: With dead ends: 3029 [2021-11-22 21:51:10,967 INFO L226 Difference]: Without dead ends: 1899 [2021-11-22 21:51:10,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:51:10,970 INFO L933 BasicCegarLoop]: 1580 mSDtfsCounter, 3 mSDsluCounter, 4728 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6308 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:51:10,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6308 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:51:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2021-11-22 21:51:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1899. [2021-11-22 21:51:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1898 states have (on average 1.3962065331928346) internal successors, (2650), 1898 states have internal predecessors, (2650), 0 states have call successors, (0), 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-22 21:51:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2650 transitions. [2021-11-22 21:51:11,596 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2650 transitions. Word has length 90 [2021-11-22 21:51:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:51:11,597 INFO L470 AbstractCegarLoop]: Abstraction has 1899 states and 2650 transitions. [2021-11-22 21:51:11,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-22 21:51:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2650 transitions. [2021-11-22 21:51:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 21:51:11,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:51:11,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:51:11,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 21:51:11,601 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:51:11,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:51:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1483745762, now seen corresponding path program 1 times [2021-11-22 21:51:11,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:51:11,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421566124] [2021-11-22 21:51:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:51:11,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:51:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:51:12,755 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-22 21:51:12,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:51:12,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421566124] [2021-11-22 21:51:12,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421566124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:51:12,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:51:12,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-11-22 21:51:12,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161343785] [2021-11-22 21:51:12,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:51:12,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-22 21:51:12,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:51:12,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-22 21:51:12,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2021-11-22 21:51:12,756 INFO L87 Difference]: Start difference. First operand 1899 states and 2650 transitions. Second operand has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 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-22 21:51:15,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:19,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:21,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:27,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:30,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:34,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:36,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:39,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:41,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:47,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:49,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:51,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:53,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:56,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:51:58,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:00,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:02,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:04,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:12,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:14,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:16,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:18,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:21,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:23,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:25,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:28,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:33,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:35,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:38,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:41,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:43,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:49,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:53,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:52:56,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:01,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:04,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:06,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:10,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:23,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:25,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:27,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:28,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:53:33,577 INFO L93 Difference]: Finished difference Result 32650 states and 47090 transitions. [2021-11-22 21:53:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2021-11-22 21:53:33,578 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-11-22 21:53:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:53:33,639 INFO L225 Difference]: With dead ends: 32650 [2021-11-22 21:53:33,639 INFO L226 Difference]: Without dead ends: 32648 [2021-11-22 21:53:33,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11739 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=4135, Invalid=28807, Unknown=0, NotChecked=0, Total=32942 [2021-11-22 21:53:33,652 INFO L933 BasicCegarLoop]: 9051 mSDtfsCounter, 71826 mSDsluCounter, 168447 mSDsCounter, 0 mSdLazyCounter, 21244 mSolverCounterSat, 625 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71826 SdHoareTripleChecker+Valid, 177498 SdHoareTripleChecker+Invalid, 21896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 21244 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.8s IncrementalHoareTripleChecker+Time [2021-11-22 21:53:33,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71826 Valid, 177498 Invalid, 21896 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [625 Valid, 21244 Invalid, 27 Unknown, 0 Unchecked, 117.8s Time] [2021-11-22 21:53:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32648 states. [2021-11-22 21:53:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32648 to 1897. [2021-11-22 21:53:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 1.396097046413502) internal successors, (2647), 1896 states have internal predecessors, (2647), 0 states have call successors, (0), 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-22 21:53:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2647 transitions. [2021-11-22 21:53:34,343 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2647 transitions. Word has length 91 [2021-11-22 21:53:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:53:34,343 INFO L470 AbstractCegarLoop]: Abstraction has 1897 states and 2647 transitions. [2021-11-22 21:53:34,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 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-22 21:53:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2647 transitions. [2021-11-22 21:53:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 21:53:34,347 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:53:34,347 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:53:34,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 21:53:34,348 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:53:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:53:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2123160036, now seen corresponding path program 1 times [2021-11-22 21:53:34,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:53:34,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150282056] [2021-11-22 21:53:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:53:34,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:53:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:53:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:53:34,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:53:34,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150282056] [2021-11-22 21:53:34,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150282056] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:53:34,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:53:34,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 21:53:34,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910569190] [2021-11-22 21:53:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:53:34,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 21:53:34,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:53:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 21:53:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-22 21:53:34,772 INFO L87 Difference]: Start difference. First operand 1897 states and 2647 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-22 21:53:36,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:38,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:41,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:43,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:47,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:51,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:54,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:53:57,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:54:09,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:54:10,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:54:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:54:14,363 INFO L93 Difference]: Finished difference Result 23473 states and 33630 transitions. [2021-11-22 21:54:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-11-22 21:54:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-11-22 21:54:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:54:14,396 INFO L225 Difference]: With dead ends: 23473 [2021-11-22 21:54:14,396 INFO L226 Difference]: Without dead ends: 21602 [2021-11-22 21:54:14,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4957 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2558, Invalid=10782, Unknown=0, NotChecked=0, Total=13340 [2021-11-22 21:54:14,408 INFO L933 BasicCegarLoop]: 5425 mSDtfsCounter, 37688 mSDsluCounter, 26690 mSDsCounter, 0 mSdLazyCounter, 3877 mSolverCounterSat, 407 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37688 SdHoareTripleChecker+Valid, 32115 SdHoareTripleChecker+Invalid, 4288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 3877 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2021-11-22 21:54:14,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37688 Valid, 32115 Invalid, 4288 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [407 Valid, 3877 Invalid, 4 Unknown, 0 Unchecked, 28.9s Time] [2021-11-22 21:54:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21602 states. [2021-11-22 21:54:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21602 to 2822. [2021-11-22 21:54:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2821 states have (on average 1.4186458702587734) internal successors, (4002), 2821 states have internal predecessors, (4002), 0 states have call successors, (0), 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-22 21:54:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 4002 transitions. [2021-11-22 21:54:15,546 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 4002 transitions. Word has length 92 [2021-11-22 21:54:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:54:15,546 INFO L470 AbstractCegarLoop]: Abstraction has 2822 states and 4002 transitions. [2021-11-22 21:54:15,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-22 21:54:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 4002 transitions. [2021-11-22 21:54:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 21:54:15,550 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:54:15,551 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:54:15,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 21:54:15,551 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:54:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:54:15,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1362101084, now seen corresponding path program 1 times [2021-11-22 21:54:15,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:54:15,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183506898] [2021-11-22 21:54:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:54:15,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:54:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:54:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 21:54:15,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:54:15,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183506898] [2021-11-22 21:54:15,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183506898] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 21:54:15,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093636601] [2021-11-22 21:54:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:54:15,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 21:54:15,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 21:54:15,657 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-22 21:54:15,664 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-22 21:54:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:54:16,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 21:54:16,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:54:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 21:54:16,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:54:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 21:54:16,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093636601] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 21:54:16,396 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 21:54:16,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-22 21:54:16,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951436098] [2021-11-22 21:54:16,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 21:54:16,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 21:54:16,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:54:16,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 21:54:16,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-11-22 21:54:16,398 INFO L87 Difference]: Start difference. First operand 2822 states and 4002 transitions. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 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-22 21:54:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:54:20,252 INFO L93 Difference]: Finished difference Result 13009 states and 18334 transitions. [2021-11-22 21:54:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 21:54:20,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 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 97 [2021-11-22 21:54:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:54:20,269 INFO L225 Difference]: With dead ends: 13009 [2021-11-22 21:54:20,269 INFO L226 Difference]: Without dead ends: 10213 [2021-11-22 21:54:20,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-11-22 21:54:20,287 INFO L933 BasicCegarLoop]: 2860 mSDtfsCounter, 10020 mSDsluCounter, 12976 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10020 SdHoareTripleChecker+Valid, 15836 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:54:20,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10020 Valid, 15836 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:54:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10213 states. [2021-11-22 21:54:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10213 to 2872. [2021-11-22 21:54:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2872 states, 2871 states have (on average 1.41901776384535) internal successors, (4074), 2871 states have internal predecessors, (4074), 0 states have call successors, (0), 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-22 21:54:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 4074 transitions. [2021-11-22 21:54:21,428 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 4074 transitions. Word has length 97 [2021-11-22 21:54:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:54:21,428 INFO L470 AbstractCegarLoop]: Abstraction has 2872 states and 4074 transitions. [2021-11-22 21:54:21,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 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-22 21:54:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 4074 transitions. [2021-11-22 21:54:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 21:54:21,433 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:54:21,433 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:54:21,455 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-22 21:54:21,655 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,SelfDestructingSolverStorable20 [2021-11-22 21:54:21,656 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:54:21,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:54:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1581232349, now seen corresponding path program 1 times [2021-11-22 21:54:21,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:54:21,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284735367] [2021-11-22 21:54:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:54:21,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:54:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 21:54:21,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 21:54:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 21:54:22,080 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 21:54:22,081 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 21:54:22,082 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-22 21:54:22,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 21:54:22,088 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:54:22,091 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 21:54:22,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:54:22 BoogieIcfgContainer [2021-11-22 21:54:22,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 21:54:22,226 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 21:54:22,226 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 21:54:22,226 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 21:54:22,227 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:48" (3/4) ... [2021-11-22 21:54:22,229 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 21:54:22,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 21:54:22,229 INFO L158 Benchmark]: Toolchain (without parser) took 578539.75ms. Allocated memory was 96.5MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 60.6MB in the beginning and 749.3MB in the end (delta: -688.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-11-22 21:54:22,230 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 54.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 21:54:22,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1250.77ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 60.6MB in the beginning and 114.0MB in the end (delta: -53.4MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2021-11-22 21:54:22,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 184.93ms. Allocated memory is still 172.0MB. Free memory was 114.0MB in the beginning and 84.7MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-11-22 21:54:22,230 INFO L158 Benchmark]: Boogie Preprocessor took 192.24ms. Allocated memory is still 172.0MB. Free memory was 84.7MB in the beginning and 92.2MB in the end (delta: -7.5MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2021-11-22 21:54:22,231 INFO L158 Benchmark]: RCFGBuilder took 2876.89ms. Allocated memory was 172.0MB in the beginning and 337.6MB in the end (delta: 165.7MB). Free memory was 92.2MB in the beginning and 217.5MB in the end (delta: -125.3MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. [2021-11-22 21:54:22,231 INFO L158 Benchmark]: TraceAbstraction took 574026.37ms. Allocated memory was 337.6MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 217.5MB in the beginning and 749.3MB in the end (delta: -531.8MB). Peak memory consumption was 978.2MB. Max. memory is 16.1GB. [2021-11-22 21:54:22,231 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 1.8GB. Free memory is still 749.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 21:54:22,236 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.10ms. Allocated memory is still 96.5MB. Free memory is still 54.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1250.77ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 60.6MB in the beginning and 114.0MB in the end (delta: -53.4MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 184.93ms. Allocated memory is still 172.0MB. Free memory was 114.0MB in the beginning and 84.7MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 192.24ms. Allocated memory is still 172.0MB. Free memory was 84.7MB in the beginning and 92.2MB in the end (delta: -7.5MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2876.89ms. Allocated memory was 172.0MB in the beginning and 337.6MB in the end (delta: 165.7MB). Free memory was 92.2MB in the beginning and 217.5MB in the end (delta: -125.3MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. * TraceAbstraction took 574026.37ms. Allocated memory was 337.6MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 217.5MB in the beginning and 749.3MB in the end (delta: -531.8MB). Peak memory consumption was 978.2MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 1.8GB. Free memory is still 749.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7129]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 4873, overapproximation of bitwiseAnd at line 4735. Possible FailurePath: [L5034] static struct net_device **slip_devs ; [L5035] static int slip_maxdev = 256; [L5850-L5853] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6723-L6726] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L6910] int LDV_IN_INTERRUPT ; VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6913] int res_sl_init_14 ; [L6914] int res_sl_open_11 ; [L6915] int res_sl_close_10 ; [L6916] struct sk_buff *var_group2 ; [L6917] struct rtnl_link_stats64 var_group3 ; [L6918] int var_sl_change_mtu_12_p1 ; [L6919] struct ifreq var_group4 ; [L6920] int var_sl_ioctl_30_p2 ; [L6921] struct tty_struct var_group5 ; [L6922] int res_slip_open_21 ; [L6923] struct file *var_group6 ; [L6924] unsigned int var_slip_ioctl_28_p2 ; [L6925] unsigned long var_slip_ioctl_28_p3 ; [L6926] unsigned int var_slip_compat_ioctl_29_p2 ; [L6927] unsigned long var_slip_compat_ioctl_29_p3 ; [L6928] unsigned char const *var_slip_receive_buf_18_p1 ; [L6929] char *var_slip_receive_buf_18_p2 ; [L6930] int var_slip_receive_buf_18_p3 ; [L6931] unsigned long var_sl_keepalive_34_p0 ; [L6932] unsigned long var_sl_outfill_33_p0 ; [L6933] int ldv_s_sl_netdev_ops_net_device_ops ; [L6934] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6935] int tmp ; [L6936] int tmp___0 ; [L6937] int tmp___1 ; [L6939] CALL, EXPR dev_alloc_skb(1U) [L7186] CALL, EXPR ldv_malloc(sizeof(struct sk_buff)) [L4847] COND FALSE !(__VERIFIER_nondet_int()) [L4852] return ((void *)0); VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=0, size=243, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] RET, EXPR ldv_malloc(sizeof(struct sk_buff)) [L7186] return ldv_malloc(sizeof(struct sk_buff)); [L6939] RET, EXPR dev_alloc_skb(1U) [L6939] var_group2 = dev_alloc_skb(1U) [L6940] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6941] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6942] LDV_IN_INTERRUPT = 1 [L6943] FCALL ldv_initialize() [L6944] FCALL ldv_handler_precall() [L6945] CALL, EXPR slip_init() [L6729] int status ; [L6730] void *tmp ; VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6732] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6740] CALL, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L4871] void *tmp ; [L4873] CALL, EXPR kmalloc(size, flags | 32768U) [L4862] void *tmp___2 ; [L4864] CALL, EXPR __kmalloc(size, flags) [L4857] CALL, EXPR ldv_malloc(size) [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4849] CALL, EXPR ldv_is_err(res) [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [\result=0, __this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, ptr={-18446744073709555711:0}, ptr={-18446744073709555711:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET, EXPR ldv_is_err(res) [L4849] CALL assume_abort_if_not(!ldv_is_err(res)) [L4838] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551575:18446744073709551578}, cond=1, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET assume_abort_if_not(!ldv_is_err(res)) [L4850] return res; VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, res={-18446744073709555711:0}, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] RET, EXPR ldv_malloc(size) [L4857] return ldv_malloc(size); [L4864] RET, EXPR __kmalloc(size, flags) [L4864] tmp___2 = __kmalloc(size, flags) [L4865] return (tmp___2); VAL [\old(flags)=4294967277, \old(size)=2048, \result={-18446744073709555711:0}, __this_module={18446744073709551575:18446744073709551578}, flags=4294967277, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, tmp___2={-18446744073709555711:0}] [L4873] RET, EXPR kmalloc(size, flags | 32768U) [L4873] tmp = kmalloc(size, flags | 32768U) [L4874] return (tmp); VAL [\old(flags)=208, \old(size)=2048, \result={-18446744073709555711:0}, __this_module={18446744073709551575:18446744073709551578}, flags=208, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709555711:0}] [L6740] RET, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6740] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6741] slip_devs = (struct net_device **)tmp VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={-18446744073709555711:0}] [L6742] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L6747] CALL, EXPR tty_register_ldisc(1, & sl_ldisc) [L7287] return __VERIFIER_nondet_int(); [L6747] RET, EXPR tty_register_ldisc(1, & sl_ldisc) [L6747] status = tty_register_ldisc(1, & sl_ldisc) [L6748] COND FALSE !(status != 0) VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, status=0, tmp={-18446744073709555711:0}] [L6753] return (status); VAL [\result=0, __this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, status=0, tmp={-18446744073709555711:0}] [L6945] RET, EXPR slip_init() [L6945] tmp = slip_init() [L6946] COND FALSE !(tmp != 0) VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=0, var_group2={0:0}, var_group3={33:0}, var_group4={35:0}, var_group5={31:0}] [L7076] tmp___1 = __VERIFIER_nondet_int() [L7077] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=0, tmp___1=-2, var_group2={0:0}, var_group3={33:0}, var_group4={35:0}, var_group5={31:0}] [L6952] tmp___0 = __VERIFIER_nondet_int() [L6954] case 0: [L6967] case 1: [L6980] case 2: [L6993] case 3: [L7001] case 4: [L7005] case 5: [L7009] case 6: [L7013] case 7: [L7017] case 8: [L7021] case 9: VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=0, tmp___0=9, tmp___1=-2, var_group2={0:0}, var_group3={33:0}, var_group4={35:0}, var_group5={31:0}] [L7022] COND TRUE ldv_s_sl_ldisc_tty_ldisc_ops == 0 [L7023] FCALL ldv_handler_precall() [L7024] CALL ldv_slip_open_3(&var_group5) [L7117] ldv_func_ret_type___1 ldv_func_res ; [L7118] int tmp ; [L7120] CALL, EXPR slip_open(tty) [L6037] struct slip *sl ; [L6038] int err ; [L6039] int tmp ; [L6040] dev_t tmp___0 ; [L6041] struct task_struct *tmp___1 ; [L6042] int tmp___2 ; [L6044] CALL, EXPR capable(12) [L7172] return __VERIFIER_nondet_int(); [L6044] RET, EXPR capable(12) [L6044] tmp = capable(12) [L6045] COND FALSE !(tmp == 0) [L6049] EXPR tty->ops [L6049] EXPR (tty->ops)->write VAL [(tty->ops)->write={-37:38}, __this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tty={31:0}, tty={31:0}, tty->ops={18446744073709551589:-3}] [L6049-L6051] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L6055] FCALL rtnl_lock() [L6056] CALL sl_sync() [L5925] int i ; [L5926] struct net_device *dev ; [L5927] struct slip *sl ; [L5928] void *tmp ; [L5930] i = 0 VAL [__this_module={18446744073709551575:18446744073709551578}, i=0, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={18446744073709551575:18446744073709551578}, i=0, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L5938] CALL, EXPR netdev_priv((struct net_device const *)dev) [L4903] return ((void *)dev + 2496U); VAL [\result={2506:-9}, __this_module={18446744073709551575:18446744073709551578}, dev={2506:-2505}, dev={2506:-2505}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5938] RET, EXPR netdev_priv((struct net_device const *)dev) [L5938] tmp = netdev_priv((struct net_device const *)dev) [L5939] sl = (struct slip *)tmp [L5940] EXPR sl->tty [L5940] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U VAL [(unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U=1, __this_module={18446744073709551575:18446744073709551578}, dev={2506:-2505}, i=0, LDV_IN_INTERRUPT=1, sl={2506:-9}, sl->tty={-38:39}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={2506:-9}] [L5940] COND TRUE (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L5949] i = i + 1 VAL [__this_module={18446744073709551575:18446744073709551578}, dev={2506:-2505}, i=1, LDV_IN_INTERRUPT=1, sl={2506:-9}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={2506:-9}] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={18446744073709551575:18446744073709551578}, dev={2506:-2505}, i=1, LDV_IN_INTERRUPT=1, sl={2506:-9}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={2506:-9}] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={18446744073709551575:18446744073709551578}, dev={18446744073709551567:49}, i=1, LDV_IN_INTERRUPT=1, sl={2506:-9}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={2506:-9}] [L6056] RET sl_sync() [L6057] EXPR tty->disc_data [L6057] sl = (struct slip *)tty->disc_data [L6058] err = -17 [L6059] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [(unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250=0, __this_module={18446744073709551575:18446744073709551578}, err=-17, LDV_IN_INTERRUPT=1, sl={51:18446744073709551565}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tty={31:0}, tty={31:0}] [L6059] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6063] err = -23 [L6064] CALL, EXPR tty_devnum(tty) [L7276] return __VERIFIER_nondet_uint(); [L6064] RET, EXPR tty_devnum(tty) [L6064] tmp___0 = tty_devnum(tty) [L6065] CALL, EXPR sl_alloc(tmp___0) [L5961] int i ; [L5962] struct net_device *dev ; [L5963] struct slip *sl ; [L5964] void *tmp ; [L5965] int tmp___0 ; [L5966] char name[16U] ; [L5967] void *tmp___1 ; [L5968] struct lock_class_key __key ; [L5969] struct lock_class_key __key___0 ; [L5970] struct lock_class_key __key___1 ; [L5972] dev = 0 VAL [\old(line)=4294967248, __key={43:0}, __key___0={42:0}, __key___1={47:0}, __this_module={18446744073709551575:18446744073709551578}, dev={0:0}, LDV_IN_INTERRUPT=1, line=4294967248, name={30:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5973] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L5977] i = 0 VAL [\old(line)=4294967248, __key={43:0}, __key___0={42:0}, __key___1={47:0}, __this_module={18446744073709551575:18446744073709551578}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, line=4294967248, name={30:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [\old(line)=4294967248, __key={43:0}, __key___0={42:0}, __key___1={47:0}, __this_module={18446744073709551575:18446744073709551578}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, line=4294967248, name={30:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L5985] i = i + 1 VAL [\old(line)=4294967248, __key={43:0}, __key___0={42:0}, __key___1={47:0}, __this_module={18446744073709551575:18446744073709551578}, dev={2506:-2505}, i=1, LDV_IN_INTERRUPT=1, line=4294967248, name={30:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [\old(line)=4294967248, __key={43:0}, __key___0={42:0}, __key___1={47:0}, __this_module={18446744073709551575:18446744073709551578}, dev={2506:-2505}, i=1, LDV_IN_INTERRUPT=1, line=4294967248, name={30:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [\old(line)=4294967248, __key={43:0}, __key___0={42:0}, __key___1={47:0}, __this_module={18446744073709551575:18446744073709551578}, dev={18446744073709551567:49}, i=1, LDV_IN_INTERRUPT=1, line=4294967248, name={30:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5992] COND FALSE !(i >= slip_maxdev) VAL [\old(line)=4294967248, __key={43:0}, __key___0={42:0}, __key___1={47:0}, __this_module={18446744073709551575:18446744073709551578}, dev={18446744073709551567:49}, i=1, LDV_IN_INTERRUPT=1, line=4294967248, name={30:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5996] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [\old(line)=4294967248, __key={43:0}, __key___0={42:0}, __key___1={47:0}, __this_module={18446744073709551575:18446744073709551578}, dev={18446744073709551567:49}, i=1, LDV_IN_INTERRUPT=1, line=4294967248, name={30:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6008] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L6010] CALL, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L7168] CALL, EXPR ldv_malloc(sizeof(struct net_device)) [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4849] CALL, EXPR ldv_is_err(res) [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [\result=0, __this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, ptr={-18446744073709551615:0}, ptr={-18446744073709551615:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4849] RET, EXPR ldv_is_err(res) [L4849] CALL assume_abort_if_not(!ldv_is_err(res)) [L4838] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551575:18446744073709551578}, cond=1, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4849] RET assume_abort_if_not(!ldv_is_err(res)) [L4850] return res; VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, res={-18446744073709551615:0}, size=2255, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L7168] RET, EXPR ldv_malloc(sizeof(struct net_device)) [L7168] return ldv_malloc(sizeof(struct net_device)); [L6010] RET, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6010] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6011] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6015] dev->base_addr = (unsigned long )i VAL [\old(line)=4294967248, __key={43:0}, __key___0={42:0}, __key___1={47:0}, __this_module={18446744073709551575:18446744073709551578}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967248, name={30:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6018] CALL, EXPR netdev_priv((struct net_device const *)dev) [L4903] return ((void *)dev + 2496U); VAL [\result={-18446744073709551615:2496}, __this_module={18446744073709551575:18446744073709551578}, dev={-18446744073709551615:0}, dev={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6018] RET, EXPR netdev_priv((struct net_device const *)dev) [L6018] tmp___1 = netdev_priv((struct net_device const *)dev) [L6019] sl = (struct slip *)tmp___1 [L6020] sl->magic = 21250 [L6021] sl->dev = dev [L6022] CALL spinlock_check(& sl->lock) [L4778] return (& lock->ldv_5934.rlock); VAL [\result={-18446744073709551615:2516}, __this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, lock={-18446744073709551615:2516}, lock={-18446744073709551615:2516}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6022] RET spinlock_check(& sl->lock) [L6023] FCALL __raw_spin_lock_init(& sl->lock.ldv_5934.rlock, "&(&sl->lock)->rlock", & __key) [L6024] sl->mode = 8U [L6025] FCALL init_timer_key(& sl->keepalive_timer, "&sl->keepalive_timer", & __key___0) [L6026] sl->keepalive_timer.data = (unsigned long )sl [L6027] sl->keepalive_timer.function = & sl_keepalive [L6028] FCALL init_timer_key(& sl->outfill_timer, "&sl->outfill_timer", & __key___1) [L6029] sl->outfill_timer.data = (unsigned long )sl [L6030] sl->outfill_timer.function = & sl_outfill [L6031] *(slip_devs + (unsigned long )i) = dev [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); VAL [\old(line)=4294967248, \result={-18446744073709551615:2496}, __this_module={18446744073709551575:18446744073709551578}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967248, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6065] RET, EXPR sl_alloc(tmp___0) [L6065] sl = sl_alloc(tmp___0) [L6066] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6070] sl->tty = tty [L6071] tty->disc_data = (void *)sl [L6072] CALL, EXPR tty_devnum(tty) [L7276] return __VERIFIER_nondet_uint(); [L6072] RET, EXPR tty_devnum(tty) [L6072] sl->line = tty_devnum(tty) [L6073] CALL, EXPR get_current() [L4746] struct task_struct *pfo_ret__ ; [L4749] case 1UL: [L4752] case 2UL: [L4755] case 4UL: [L4758] case 8UL: VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4765] return (pfo_ret__); VAL [\result={18446744073709551591:-4}, __this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, pfo_ret__={18446744073709551591:-4}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6073] RET, EXPR get_current() [L6073] tmp___1 = get_current() [L6074] EXPR tmp___1->pid [L6074] sl->pid = tmp___1->pid [L6075] CALL, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L4735] EXPR addr + (unsigned long )(nr / 64U) [L4735] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6075] RET, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6075] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6076] COND FALSE !(tmp___2 == 0) VAL [__this_module={18446744073709551575:18446744073709551578}, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967248, tmp___1={18446744073709551591:-4}, tmp___2=1, tty={31:0}, tty={31:0}] [L6090] EXPR sl->keepalive VAL [__this_module={18446744073709551575:18446744073709551578}, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl->keepalive=512, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967248, tmp___1={18446744073709551591:-4}, tmp___2=1, tty={31:0}, tty={31:0}] [L6090] COND FALSE !((unsigned int )sl->keepalive != 0U) [L6095] EXPR sl->outfill VAL [__this_module={18446744073709551575:18446744073709551578}, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl->outfill=768, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967248, tmp___1={18446744073709551591:-4}, tmp___2=1, tty={31:0}, tty={31:0}] [L6095] COND FALSE !((unsigned int )sl->outfill != 0U) [L6100] FCALL rtnl_unlock() [L6101] tty->receive_room = 65536U [L6102] EXPR sl->dev [L6102] EXPR (sl->dev)->base_addr [L6102] return ((int )(sl->dev)->base_addr); [L7120] RET, EXPR slip_open(tty) [L7120] tmp = slip_open(tty) [L7121] ldv_func_res = tmp [L7122] CALL ldv_check_callback_ret_val(ldv_func_res) [L7135] COND FALSE !(ret_val <= 0) [L7137] CALL ldv_error() [L7129] reach_error() VAL [__this_module={18446744073709551575:18446744073709551578}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1168 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 573.8s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 559.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 104 mSolverCounterUnknown, 383069 SdHoareTripleChecker+Valid, 469.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383069 mSDsluCounter, 828869 SdHoareTripleChecker+Invalid, 452.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 745079 mSDsCounter, 2975 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81560 IncrementalHoareTripleChecker+Invalid, 84639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2975 mSolverCounterUnsat, 83790 mSDtfsCounter, 81560 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1255 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 871 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47447 ImplicationChecksByTransitivity, 35.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2872occurred in iteration=21, InterpolantAutomatonStates: 792, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 157371 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1765 NumberOfCodeBlocks, 1765 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1810 ConstructedInterpolants, 0 QuantifiedInterpolants, 10694 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2072 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 13/19 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-22 21:54:22,263 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/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 21:54:24,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 21:54:24,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 21:54:24,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 21:54:24,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 21:54:24,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 21:54:24,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 21:54:24,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 21:54:24,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 21:54:24,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 21:54:24,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 21:54:24,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 21:54:24,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 21:54:24,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 21:54:24,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 21:54:24,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 21:54:24,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 21:54:24,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 21:54:24,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 21:54:24,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 21:54:24,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 21:54:24,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 21:54:24,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 21:54:24,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 21:54:24,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 21:54:24,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 21:54:24,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 21:54:24,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 21:54:24,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 21:54:24,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 21:54:24,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 21:54:24,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 21:54:24,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 21:54:24,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 21:54:24,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 21:54:24,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 21:54:24,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 21:54:24,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 21:54:24,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 21:54:24,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 21:54:24,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 21:54:24,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-22 21:54:24,292 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 21:54:24,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 21:54:24,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 21:54:24,293 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 21:54:24,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 21:54:24,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 21:54:24,295 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 21:54:24,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 21:54:24,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 21:54:24,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 21:54:24,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 21:54:24,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 21:54:24,297 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 21:54:24,297 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 21:54:24,297 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 21:54:24,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 21:54:24,297 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 21:54:24,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 21:54:24,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 21:54:24,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 21:54:24,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 21:54:24,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:54:24,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 21:54:24,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 21:54:24,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 21:54:24,299 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 21:54:24,299 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 21:54:24,299 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 21:54:24,300 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 21:54:24,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 21:54:24,300 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 21:54:24,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 21:54:24,300 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2021-11-22 21:54:24,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 21:54:24,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 21:54:24,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 21:54:24,642 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 21:54:24,643 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 21:54:24,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-22 21:54:24,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9319fe2/db163ab9f19a4318a5b50039c0f0184b/FLAG5be343e44 [2021-11-22 21:54:25,325 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 21:54:25,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-22 21:54:25,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9319fe2/db163ab9f19a4318a5b50039c0f0184b/FLAG5be343e44 [2021-11-22 21:54:25,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9319fe2/db163ab9f19a4318a5b50039c0f0184b [2021-11-22 21:54:25,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 21:54:25,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 21:54:25,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 21:54:25,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 21:54:25,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 21:54:25,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:25" (1/1) ... [2021-11-22 21:54:25,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428ce769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:25, skipping insertion in model container [2021-11-22 21:54:25,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:25" (1/1) ... [2021-11-22 21:54:25,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 21:54:25,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:54:27,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-22 21:54:27,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:54:27,051 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-22 21:54:27,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:54:27,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-22 21:54:27,301 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:54:27,313 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 21:54:27,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-22 21:54:27,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:54:27,589 INFO L208 MainTranslator]: Completed translation [2021-11-22 21:54:27,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27 WrapperNode [2021-11-22 21:54:27,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 21:54:27,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 21:54:27,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 21:54:27,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 21:54:27,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:27,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:27,807 INFO L137 Inliner]: procedures = 170, calls = 812, calls flagged for inlining = 287, calls inlined = 486, statements flattened = 5621 [2021-11-22 21:54:27,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 21:54:27,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 21:54:27,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 21:54:27,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 21:54:27,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:27,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:27,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:27,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:27,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:27,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:27,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:28,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 21:54:28,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 21:54:28,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 21:54:28,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 21:54:28,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (1/1) ... [2021-11-22 21:54:28,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:54:28,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 21:54:28,042 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-22 21:54:28,061 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-22 21:54:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-22 21:54:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-22 21:54:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-22 21:54:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-22 21:54:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-22 21:54:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 21:54:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-22 21:54:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-22 21:54:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-22 21:54:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-22 21:54:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 21:54:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 21:54:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 21:54:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 21:54:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-22 21:54:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-22 21:54:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-22 21:54:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-22 21:54:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 21:54:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-22 21:54:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-22 21:54:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-22 21:54:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 21:54:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-22 21:54:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 21:54:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 21:54:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-22 21:54:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-22 21:54:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 21:54:28,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 21:54:28,574 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 21:54:28,576 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 21:54:59,713 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 21:54:59,737 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 21:54:59,737 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 21:54:59,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:59 BoogieIcfgContainer [2021-11-22 21:54:59,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 21:54:59,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 21:54:59,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 21:54:59,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 21:54:59,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:54:25" (1/3) ... [2021-11-22 21:54:59,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb21b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:59, skipping insertion in model container [2021-11-22 21:54:59,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:27" (2/3) ... [2021-11-22 21:54:59,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb21b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:59, skipping insertion in model container [2021-11-22 21:54:59,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:59" (3/3) ... [2021-11-22 21:54:59,747 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-22 21:54:59,751 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 21:54:59,752 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-22 21:54:59,808 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 21:54:59,814 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-22 21:54:59,815 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-22 21:54:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 1168 states, 1166 states have (on average 1.4408233276157805) internal successors, (1680), 1167 states have internal predecessors, (1680), 0 states have call successors, (0), 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-22 21:54:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 21:54:59,857 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:54:59,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:54:59,858 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:54:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:54:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash -32637876, now seen corresponding path program 1 times [2021-11-22 21:54:59,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:54:59,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131060797] [2021-11-22 21:54:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:54:59,873 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:54:59,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:54:59,875 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-22 21:54:59,889 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-22 21:55:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:00,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:55:00,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:00,502 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-22 21:55:00,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:00,698 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-22 21:55:00,699 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:00,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131060797] [2021-11-22 21:55:00,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131060797] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:00,699 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:00,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-22 21:55:00,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595941809] [2021-11-22 21:55:00,701 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:00,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:55:00,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:00,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:55:00,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:55:00,725 INFO L87 Difference]: Start difference. First operand has 1168 states, 1166 states have (on average 1.4408233276157805) internal successors, (1680), 1167 states have internal predecessors, (1680), 0 states have call successors, (0), 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 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-22 21:55:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:55:00,977 INFO L93 Difference]: Finished difference Result 2330 states and 3352 transitions. [2021-11-22 21:55:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:55:00,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 37 [2021-11-22 21:55:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:55:01,003 INFO L225 Difference]: With dead ends: 2330 [2021-11-22 21:55:01,004 INFO L226 Difference]: Without dead ends: 1129 [2021-11-22 21:55:01,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:55:01,014 INFO L933 BasicCegarLoop]: 1653 mSDtfsCounter, 3316 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3316 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:55:01,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3316 Valid, 1653 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:55:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-11-22 21:55:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2021-11-22 21:55:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.427304964539007) internal successors, (1610), 1128 states have internal predecessors, (1610), 0 states have call successors, (0), 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-22 21:55:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1610 transitions. [2021-11-22 21:55:01,102 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1610 transitions. Word has length 37 [2021-11-22 21:55:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:55:01,103 INFO L470 AbstractCegarLoop]: Abstraction has 1129 states and 1610 transitions. [2021-11-22 21:55:01,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-22 21:55:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1610 transitions. [2021-11-22 21:55:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 21:55:01,108 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:55:01,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:55:01,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-22 21:55:01,319 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-22 21:55:01,320 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:55:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:55:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash -10005622, now seen corresponding path program 1 times [2021-11-22 21:55:01,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:55:01,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913195511] [2021-11-22 21:55:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:55:01,325 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:55:01,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:55:01,332 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-22 21:55:01,372 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-22 21:55:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:01,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 21:55:01,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:01,797 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-22 21:55:01,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:01,938 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-22 21:55:01,938 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:01,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913195511] [2021-11-22 21:55:01,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913195511] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:01,938 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:01,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-22 21:55:01,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461599083] [2021-11-22 21:55:01,939 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:01,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 21:55:01,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:01,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 21:55:01,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 21:55:01,940 INFO L87 Difference]: Start difference. First operand 1129 states and 1610 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-22 21:55:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:55:02,036 INFO L93 Difference]: Finished difference Result 2233 states and 3191 transitions. [2021-11-22 21:55:02,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:55:02,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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 37 [2021-11-22 21:55:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:55:02,040 INFO L225 Difference]: With dead ends: 2233 [2021-11-22 21:55:02,041 INFO L226 Difference]: Without dead ends: 1129 [2021-11-22 21:55:02,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:55:02,043 INFO L933 BasicCegarLoop]: 1609 mSDtfsCounter, 1 mSDsluCounter, 4819 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6428 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:55:02,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 6428 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:55:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-11-22 21:55:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2021-11-22 21:55:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.426418439716312) internal successors, (1609), 1128 states have internal predecessors, (1609), 0 states have call successors, (0), 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-22 21:55:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1609 transitions. [2021-11-22 21:55:02,067 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1609 transitions. Word has length 37 [2021-11-22 21:55:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:55:02,068 INFO L470 AbstractCegarLoop]: Abstraction has 1129 states and 1609 transitions. [2021-11-22 21:55:02,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-22 21:55:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1609 transitions. [2021-11-22 21:55:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 21:55:02,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:55:02,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:55:02,080 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-22 21:55:02,280 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-22 21:55:02,281 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:55:02,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:55:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1490205746, now seen corresponding path program 1 times [2021-11-22 21:55:02,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:55:02,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194648320] [2021-11-22 21:55:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:55:02,282 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:55:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:55:02,283 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-22 21:55:02,288 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-22 21:55:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:02,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-22 21:55:02,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:02,944 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-22 21:55:02,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:03,359 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-22 21:55:03,359 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:03,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194648320] [2021-11-22 21:55:03,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194648320] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:03,360 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:03,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-22 21:55:03,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485291222] [2021-11-22 21:55:03,360 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:03,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 21:55:03,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:03,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 21:55:03,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-22 21:55:03,361 INFO L87 Difference]: Start difference. First operand 1129 states and 1609 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 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-22 21:55:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:55:11,335 INFO L93 Difference]: Finished difference Result 9394 states and 13493 transitions. [2021-11-22 21:55:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 21:55:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 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 40 [2021-11-22 21:55:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:55:11,362 INFO L225 Difference]: With dead ends: 9394 [2021-11-22 21:55:11,362 INFO L226 Difference]: Without dead ends: 8281 [2021-11-22 21:55:11,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2021-11-22 21:55:11,366 INFO L933 BasicCegarLoop]: 5714 mSDtfsCounter, 18178 mSDsluCounter, 39576 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18178 SdHoareTripleChecker+Valid, 45290 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2021-11-22 21:55:11,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18178 Valid, 45290 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2021-11-22 21:55:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8281 states. [2021-11-22 21:55:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8281 to 2205. [2021-11-22 21:55:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 2204 states have (on average 1.4305807622504538) internal successors, (3153), 2204 states have internal predecessors, (3153), 0 states have call successors, (0), 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-22 21:55:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3153 transitions. [2021-11-22 21:55:11,485 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3153 transitions. Word has length 40 [2021-11-22 21:55:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:55:11,485 INFO L470 AbstractCegarLoop]: Abstraction has 2205 states and 3153 transitions. [2021-11-22 21:55:11,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 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-22 21:55:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3153 transitions. [2021-11-22 21:55:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-22 21:55:11,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:55:11,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:55:11,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-22 21:55:11,697 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-22 21:55:11,698 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:55:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:55:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash 402881647, now seen corresponding path program 1 times [2021-11-22 21:55:11,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:55:11,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115529814] [2021-11-22 21:55:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:55:11,700 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:55:11,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:55:11,701 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-22 21:55:11,703 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-22 21:55:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:11,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 21:55:11,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:12,080 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-22 21:55:12,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:12,166 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-22 21:55:12,166 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:12,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115529814] [2021-11-22 21:55:12,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115529814] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:12,167 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:12,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-22 21:55:12,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700378578] [2021-11-22 21:55:12,167 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:12,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 21:55:12,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:12,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 21:55:12,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 21:55:12,168 INFO L87 Difference]: Start difference. First operand 2205 states and 3153 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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-22 21:55:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:55:12,662 INFO L93 Difference]: Finished difference Result 7456 states and 10685 transitions. [2021-11-22 21:55:12,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 21:55:12,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 43 [2021-11-22 21:55:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:55:12,687 INFO L225 Difference]: With dead ends: 7456 [2021-11-22 21:55:12,687 INFO L226 Difference]: Without dead ends: 7454 [2021-11-22 21:55:12,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-11-22 21:55:12,690 INFO L933 BasicCegarLoop]: 3177 mSDtfsCounter, 7072 mSDsluCounter, 11112 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7072 SdHoareTripleChecker+Valid, 14289 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:55:12,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7072 Valid, 14289 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:55:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7454 states. [2021-11-22 21:55:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7454 to 2209. [2021-11-22 21:55:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 2208 states have (on average 1.4298007246376812) internal successors, (3157), 2208 states have internal predecessors, (3157), 0 states have call successors, (0), 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-22 21:55:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3157 transitions. [2021-11-22 21:55:12,831 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3157 transitions. Word has length 43 [2021-11-22 21:55:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:55:12,832 INFO L470 AbstractCegarLoop]: Abstraction has 2209 states and 3157 transitions. [2021-11-22 21:55:12,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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-22 21:55:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3157 transitions. [2021-11-22 21:55:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 21:55:12,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:55:12,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:55:12,848 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-22 21:55:13,049 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-22 21:55:13,050 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:55:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:55:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1215588642, now seen corresponding path program 1 times [2021-11-22 21:55:13,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:55:13,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227200263] [2021-11-22 21:55:13,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:55:13,052 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:55:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:55:13,053 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-22 21:55:13,054 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-22 21:55:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:13,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 21:55:13,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:13,682 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-22 21:55:13,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:14,029 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-22 21:55:14,030 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:14,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227200263] [2021-11-22 21:55:14,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227200263] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:14,030 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:14,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-22 21:55:14,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254555410] [2021-11-22 21:55:14,030 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:14,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 21:55:14,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:14,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 21:55:14,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 21:55:14,031 INFO L87 Difference]: Start difference. First operand 2209 states and 3157 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-22 21:55:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:55:14,475 INFO L93 Difference]: Finished difference Result 8739 states and 12517 transitions. [2021-11-22 21:55:14,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:55:14,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 51 [2021-11-22 21:55:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:55:14,494 INFO L225 Difference]: With dead ends: 8739 [2021-11-22 21:55:14,494 INFO L226 Difference]: Without dead ends: 6557 [2021-11-22 21:55:14,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:55:14,497 INFO L933 BasicCegarLoop]: 2912 mSDtfsCounter, 6788 mSDsluCounter, 4495 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6788 SdHoareTripleChecker+Valid, 7407 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:55:14,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6788 Valid, 7407 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:55:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2021-11-22 21:55:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 2229. [2021-11-22 21:55:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2228 states have (on average 1.4295332136445242) internal successors, (3185), 2228 states have internal predecessors, (3185), 0 states have call successors, (0), 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-22 21:55:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 3185 transitions. [2021-11-22 21:55:14,648 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 3185 transitions. Word has length 51 [2021-11-22 21:55:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:55:14,648 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 3185 transitions. [2021-11-22 21:55:14,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-22 21:55:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 3185 transitions. [2021-11-22 21:55:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 21:55:14,649 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:55:14,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:55:14,672 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-22 21:55:14,860 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-22 21:55:14,860 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:55:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:55:14,861 INFO L85 PathProgramCache]: Analyzing trace with hash -107643453, now seen corresponding path program 1 times [2021-11-22 21:55:14,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:55:14,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373297873] [2021-11-22 21:55:14,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:55:14,871 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:55:14,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:55:14,872 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-22 21:55:14,873 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-22 21:55:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:15,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:55:15,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:15,290 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-22 21:55:15,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:15,352 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-22 21:55:15,352 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:15,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373297873] [2021-11-22 21:55:15,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373297873] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:15,352 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:15,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:55:15,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683140815] [2021-11-22 21:55:15,352 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:15,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:55:15,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:15,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:55:15,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:55:15,353 INFO L87 Difference]: Start difference. First operand 2229 states and 3185 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-22 21:55:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:55:15,497 INFO L93 Difference]: Finished difference Result 4433 states and 6345 transitions. [2021-11-22 21:55:15,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:55:15,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-22 21:55:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:55:15,503 INFO L225 Difference]: With dead ends: 4433 [2021-11-22 21:55:15,504 INFO L226 Difference]: Without dead ends: 2231 [2021-11-22 21:55:15,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:55:15,506 INFO L933 BasicCegarLoop]: 1607 mSDtfsCounter, 0 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:55:15,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3209 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:55:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-11-22 21:55:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231. [2021-11-22 21:55:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.4291479820627804) internal successors, (3187), 2230 states have internal predecessors, (3187), 0 states have call successors, (0), 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-22 21:55:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 3187 transitions. [2021-11-22 21:55:15,615 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 3187 transitions. Word has length 53 [2021-11-22 21:55:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:55:15,617 INFO L470 AbstractCegarLoop]: Abstraction has 2231 states and 3187 transitions. [2021-11-22 21:55:15,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-22 21:55:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 3187 transitions. [2021-11-22 21:55:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 21:55:15,618 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:55:15,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:55:15,641 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-22 21:55:15,830 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-22 21:55:15,831 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:55:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:55:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1882650815, now seen corresponding path program 1 times [2021-11-22 21:55:15,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:55:15,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585124912] [2021-11-22 21:55:15,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:55:15,832 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:55:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:55:15,833 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-22 21:55:15,835 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-22 21:55:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:16,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 21:55:16,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:16,297 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-22 21:55:16,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:16,478 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-22 21:55:16,479 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:16,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585124912] [2021-11-22 21:55:16,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585124912] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:16,479 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:16,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-22 21:55:16,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788722397] [2021-11-22 21:55:16,479 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:16,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 21:55:16,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:16,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 21:55:16,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 21:55:16,480 INFO L87 Difference]: Start difference. First operand 2231 states and 3187 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 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-22 21:55:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:55:17,797 INFO L93 Difference]: Finished difference Result 11187 states and 16025 transitions. [2021-11-22 21:55:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 21:55:17,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 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 53 [2021-11-22 21:55:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:55:17,817 INFO L225 Difference]: With dead ends: 11187 [2021-11-22 21:55:17,818 INFO L226 Difference]: Without dead ends: 11185 [2021-11-22 21:55:17,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-11-22 21:55:17,822 INFO L933 BasicCegarLoop]: 4749 mSDtfsCounter, 13801 mSDsluCounter, 16841 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13801 SdHoareTripleChecker+Valid, 21590 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 21:55:17,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13801 Valid, 21590 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 21:55:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2021-11-22 21:55:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 2235. [2021-11-22 21:55:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2235 states, 2234 states have (on average 1.428379588182632) internal successors, (3191), 2234 states have internal predecessors, (3191), 0 states have call successors, (0), 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-22 21:55:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3191 transitions. [2021-11-22 21:55:18,022 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3191 transitions. Word has length 53 [2021-11-22 21:55:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:55:18,022 INFO L470 AbstractCegarLoop]: Abstraction has 2235 states and 3191 transitions. [2021-11-22 21:55:18,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 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-22 21:55:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3191 transitions. [2021-11-22 21:55:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 21:55:18,024 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:55:18,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:55:18,037 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-22 21:55:18,234 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-22 21:55:18,235 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:55:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:55:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash 11047258, now seen corresponding path program 1 times [2021-11-22 21:55:18,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:55:18,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782842931] [2021-11-22 21:55:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:55:18,237 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:55:18,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:55:18,238 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-22 21:55:18,240 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-22 21:55:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:18,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:55:18,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:19,001 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-22 21:55:19,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:19,301 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-22 21:55:19,301 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:19,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782842931] [2021-11-22 21:55:19,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782842931] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:19,301 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:19,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:55:19,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708402448] [2021-11-22 21:55:19,302 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:19,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:55:19,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:19,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:55:19,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:55:19,303 INFO L87 Difference]: Start difference. First operand 2235 states and 3191 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:55:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:55:19,667 INFO L93 Difference]: Finished difference Result 2237 states and 3192 transitions. [2021-11-22 21:55:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:55:19,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-22 21:55:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:55:19,686 INFO L225 Difference]: With dead ends: 2237 [2021-11-22 21:55:19,686 INFO L226 Difference]: Without dead ends: 1144 [2021-11-22 21:55:19,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:55:19,693 INFO L933 BasicCegarLoop]: 1592 mSDtfsCounter, 1554 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 21:55:19,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1554 Valid, 1611 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 21:55:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2021-11-22 21:55:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2021-11-22 21:55:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.4225721784776904) internal successors, (1626), 1143 states have internal predecessors, (1626), 0 states have call successors, (0), 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-22 21:55:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1626 transitions. [2021-11-22 21:55:19,759 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1626 transitions. Word has length 67 [2021-11-22 21:55:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:55:19,759 INFO L470 AbstractCegarLoop]: Abstraction has 1144 states and 1626 transitions. [2021-11-22 21:55:19,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:55:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1626 transitions. [2021-11-22 21:55:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 21:55:19,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:55:19,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:55:19,775 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-22 21:55:19,974 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-22 21:55:19,975 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:55:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:55:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1521347156, now seen corresponding path program 1 times [2021-11-22 21:55:19,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:55:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006295551] [2021-11-22 21:55:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:55:19,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:55:19,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:55:19,978 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-22 21:55:19,979 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-22 21:55:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:20,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 21:55:20,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:20,721 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-22 21:55:20,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:21,180 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-22 21:55:21,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:21,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006295551] [2021-11-22 21:55:21,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006295551] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:21,183 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:21,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-22 21:55:21,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269933180] [2021-11-22 21:55:21,183 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:21,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 21:55:21,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 21:55:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 21:55:21,184 INFO L87 Difference]: Start difference. First operand 1144 states and 1626 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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-22 21:55:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:55:21,994 INFO L93 Difference]: Finished difference Result 4471 states and 6387 transitions. [2021-11-22 21:55:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:55:21,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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-22 21:55:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:55:22,000 INFO L225 Difference]: With dead ends: 4471 [2021-11-22 21:55:22,001 INFO L226 Difference]: Without dead ends: 3354 [2021-11-22 21:55:22,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:55:22,003 INFO L933 BasicCegarLoop]: 3137 mSDtfsCounter, 4734 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 7838 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 21:55:22,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4734 Valid, 7838 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 21:55:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2021-11-22 21:55:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 1149. [2021-11-22 21:55:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.421602787456446) internal successors, (1632), 1148 states have internal predecessors, (1632), 0 states have call successors, (0), 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-22 21:55:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1632 transitions. [2021-11-22 21:55:22,098 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1632 transitions. Word has length 69 [2021-11-22 21:55:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:55:22,098 INFO L470 AbstractCegarLoop]: Abstraction has 1149 states and 1632 transitions. [2021-11-22 21:55:22,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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-22 21:55:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1632 transitions. [2021-11-22 21:55:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-22 21:55:22,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:55:22,101 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:55:22,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-22 21:55:22,315 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-22 21:55:22,316 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:55:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:55:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1315221004, now seen corresponding path program 1 times [2021-11-22 21:55:22,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:55:22,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727734540] [2021-11-22 21:55:22,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:55:22,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:55:22,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:55:22,319 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-22 21:55:22,325 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-22 21:55:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:55:22,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-22 21:55:22,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:55:23,316 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 48 treesize of output 30 [2021-11-22 21:55:23,326 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 27 treesize of output 9 [2021-11-22 21:55:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 21:55:23,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:55:25,980 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 21:55:25,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2021-11-22 21:55:26,131 INFO L354 Elim1Store]: treesize reduction 9, result has 50.0 percent of original size [2021-11-22 21:55:26,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2021-11-22 21:55:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 21:55:26,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:55:26,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727734540] [2021-11-22 21:55:26,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727734540] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:55:26,193 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:55:26,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 11 [2021-11-22 21:55:26,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265936779] [2021-11-22 21:55:26,193 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:55:26,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 21:55:26,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:55:26,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 21:55:26,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-22 21:55:26,194 INFO L87 Difference]: Start difference. First operand 1149 states and 1632 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 21:55:30,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:32,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:40,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:42,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:46,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:48,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:49,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:51,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:54,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:56,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:55:58,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:02,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:04,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:08,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:10,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:12,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:14,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:17,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:25,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:30,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:46,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:48,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:50,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:53,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:56:59,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:05,901 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:09,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:11,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:13,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:15,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:18,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:20,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:23,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:25,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:28,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:30,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:32,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:34,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:43,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:49,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:52,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:57,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:57:59,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:03,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:08,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:15,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:17,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:19,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:21,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:23,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:25,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:28,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:30,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:33,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:40,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:45,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:46,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:58:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:58:46,814 INFO L93 Difference]: Finished difference Result 13258 states and 19325 transitions. [2021-11-22 21:58:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-22 21:58:46,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 75 [2021-11-22 21:58:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:58:46,835 INFO L225 Difference]: With dead ends: 13258 [2021-11-22 21:58:46,835 INFO L226 Difference]: Without dead ends: 12136 [2021-11-22 21:58:46,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2021-11-22 21:58:46,839 INFO L933 BasicCegarLoop]: 4039 mSDtfsCounter, 16725 mSDsluCounter, 31808 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 265 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 185.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16725 SdHoareTripleChecker+Valid, 35847 SdHoareTripleChecker+Invalid, 3693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 194.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:58:46,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16725 Valid, 35847 Invalid, 3693 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [265 Valid, 3391 Invalid, 37 Unknown, 0 Unchecked, 194.0s Time] [2021-11-22 21:58:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12136 states. [2021-11-22 21:58:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12136 to 1654. [2021-11-22 21:58:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 1.4355716878402904) internal successors, (2373), 1653 states have internal predecessors, (2373), 0 states have call successors, (0), 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-22 21:58:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2373 transitions. [2021-11-22 21:58:47,085 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2373 transitions. Word has length 75 [2021-11-22 21:58:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:58:47,085 INFO L470 AbstractCegarLoop]: Abstraction has 1654 states and 2373 transitions. [2021-11-22 21:58:47,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 21:58:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2373 transitions. [2021-11-22 21:58:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 21:58:47,087 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:58:47,087 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:58:47,103 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-22 21:58:47,300 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-22 21:58:47,301 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:58:47,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:58:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1061661846, now seen corresponding path program 1 times [2021-11-22 21:58:47,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:58:47,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793026768] [2021-11-22 21:58:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:58:47,302 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:58:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:58:47,303 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-22 21:58:47,304 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-22 21:58:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:58:47,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 21:58:47,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:58:47,920 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-22 21:58:47,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:58:48,092 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-22 21:58:48,092 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:58:48,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793026768] [2021-11-22 21:58:48,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793026768] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:58:48,093 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:58:48,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-22 21:58:48,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981292964] [2021-11-22 21:58:48,093 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:58:48,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 21:58:48,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:58:48,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 21:58:48,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 21:58:48,094 INFO L87 Difference]: Start difference. First operand 1654 states and 2373 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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-22 21:58:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:58:49,277 INFO L93 Difference]: Finished difference Result 7012 states and 10115 transitions. [2021-11-22 21:58:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:58:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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 77 [2021-11-22 21:58:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:58:49,286 INFO L225 Difference]: With dead ends: 7012 [2021-11-22 21:58:49,286 INFO L226 Difference]: Without dead ends: 5385 [2021-11-22 21:58:49,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:58:49,288 INFO L933 BasicCegarLoop]: 2941 mSDtfsCounter, 9223 mSDsluCounter, 7143 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9223 SdHoareTripleChecker+Valid, 10084 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 21:58:49,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9223 Valid, 10084 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 21:58:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5385 states. [2021-11-22 21:58:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5385 to 1656. [2021-11-22 21:58:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 1.4344410876132931) internal successors, (2374), 1655 states have internal predecessors, (2374), 0 states have call successors, (0), 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-22 21:58:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2374 transitions. [2021-11-22 21:58:49,464 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2374 transitions. Word has length 77 [2021-11-22 21:58:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:58:49,464 INFO L470 AbstractCegarLoop]: Abstraction has 1656 states and 2374 transitions. [2021-11-22 21:58:49,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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-22 21:58:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2374 transitions. [2021-11-22 21:58:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-22 21:58:49,467 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:58:49,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 21:58:49,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-22 21:58:49,675 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-22 21:58:49,676 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 21:58:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:58:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash 828915746, now seen corresponding path program 1 times [2021-11-22 21:58:49,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:58:49,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143754524] [2021-11-22 21:58:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:58:49,678 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:58:49,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:58:49,679 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-22 21:58:49,680 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-22 21:58:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:58:50,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 21:58:50,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:58:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:58:50,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:58:50,748 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-22 21:58:50,748 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:58:50,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143754524] [2021-11-22 21:58:50,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143754524] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:58:50,748 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:58:50,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-22 21:58:50,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219524858] [2021-11-22 21:58:50,748 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:58:50,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 21:58:50,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:58:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 21:58:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 21:58:50,749 INFO L87 Difference]: Start difference. First operand 1656 states and 2374 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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