./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:40:46,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:40:46,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:40:46,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:40:46,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:40:46,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:40:46,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:40:46,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:40:46,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:40:46,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:40:46,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:40:46,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:40:46,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:40:46,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:40:46,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:40:46,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:40:46,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:40:46,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:40:46,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:40:46,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:40:46,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:40:46,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:40:46,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:40:46,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:40:46,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:40:46,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:40:46,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:40:46,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:40:46,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:40:46,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:40:46,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:40:46,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:40:46,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:40:46,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:40:46,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:40:46,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:40:46,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:40:46,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:40:46,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:40:46,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:40:46,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:40:46,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:40:46,298 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:40:46,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:40:46,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:40:46,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:40:46,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:40:46,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:40:46,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:40:46,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:40:46,300 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:40:46,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:40:46,300 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:40:46,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:40:46,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:40:46,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:40:46,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:40:46,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:40:46,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:40:46,301 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:40:46,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:40:46,302 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:40:46,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:40:46,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:40:46,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:40:46,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:40:46,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:40:46,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:40:46,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:40:46,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:40:46,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:40:46,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:40:46,303 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:40:46,303 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:40:46,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:40:46,304 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:40:46,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2021-12-14 11:40:46,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:40:46,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:40:46,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:40:46,491 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:40:46,491 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:40:46,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-14 11:40:46,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77ff3fed/4e58a589af4d4578b8ec8454ade88b55/FLAGd5f48e61e [2021-12-14 11:40:46,885 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:40:46,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-14 11:40:46,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77ff3fed/4e58a589af4d4578b8ec8454ade88b55/FLAGd5f48e61e [2021-12-14 11:40:46,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77ff3fed/4e58a589af4d4578b8ec8454ade88b55 [2021-12-14 11:40:46,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:40:46,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:40:46,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:40:46,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:40:46,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:40:46,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36435074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46, skipping insertion in model container [2021-12-14 11:40:46,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:40:46,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:40:47,091 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/bitvector/byte_add_2-2.i[1168,1181] [2021-12-14 11:40:47,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:40:47,141 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:40:47,156 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/bitvector/byte_add_2-2.i[1168,1181] [2021-12-14 11:40:47,180 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:40:47,188 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:40:47,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47 WrapperNode [2021-12-14 11:40:47,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:40:47,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:40:47,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:40:47,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:40:47,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,229 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-14 11:40:47,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:40:47,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:40:47,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:40:47,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:40:47,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:40:47,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:40:47,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:40:47,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:40:47,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (1/1) ... [2021-12-14 11:40:47,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:40:47,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:47,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 11:40:47,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 11:40:47,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:40:47,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:40:47,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:40:47,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:40:47,388 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:40:47,390 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:40:47,569 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:40:47,573 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:40:47,575 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 11:40:47,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:47 BoogieIcfgContainer [2021-12-14 11:40:47,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:40:47,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:40:47,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:40:47,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:40:47,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:40:46" (1/3) ... [2021-12-14 11:40:47,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c28d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:40:47, skipping insertion in model container [2021-12-14 11:40:47,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:47" (2/3) ... [2021-12-14 11:40:47,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c28d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:40:47, skipping insertion in model container [2021-12-14 11:40:47,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:47" (3/3) ... [2021-12-14 11:40:47,591 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2021-12-14 11:40:47,594 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:40:47,605 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:40:47,643 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:40:47,648 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 11:40:47,649 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:40:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 11:40:47,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:47,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:47,670 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-14 11:40:47,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:47,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966319681] [2021-12-14 11:40:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:47,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:47,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:47,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966319681] [2021-12-14 11:40:47,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966319681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:47,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:47,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:40:47,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049091563] [2021-12-14 11:40:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:47,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:40:47,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:47,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:40:47,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:40:47,845 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:47,862 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-14 11:40:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:40:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 11:40:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:47,870 INFO L225 Difference]: With dead ends: 57 [2021-12-14 11:40:47,870 INFO L226 Difference]: Without dead ends: 38 [2021-12-14 11:40:47,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:40:47,875 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:47,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-14 11:40:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-14 11:40:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 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-12-14 11:40:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-14 11:40:47,904 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-14 11:40:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:47,904 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-14 11:40:47,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-14 11:40:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 11:40:47,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:47,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:47,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:40:47,907 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-14 11:40:47,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:47,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424089055] [2021-12-14 11:40:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:47,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:48,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:48,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424089055] [2021-12-14 11:40:48,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424089055] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:48,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:48,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:40:48,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575354808] [2021-12-14 11:40:48,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:48,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:40:48,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:48,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:40:48,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:48,016 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:48,135 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2021-12-14 11:40:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:40:48,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 11:40:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:48,139 INFO L225 Difference]: With dead ends: 89 [2021-12-14 11:40:48,139 INFO L226 Difference]: Without dead ends: 61 [2021-12-14 11:40:48,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12-14 11:40:48,143 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:48,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-14 11:40:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-12-14 11:40:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 58 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-12-14 11:40:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2021-12-14 11:40:48,149 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 12 [2021-12-14 11:40:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:48,149 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2021-12-14 11:40:48,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2021-12-14 11:40:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 11:40:48,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:48,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:48,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:40:48,151 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:48,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1336656122, now seen corresponding path program 1 times [2021-12-14 11:40:48,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:48,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509693790] [2021-12-14 11:40:48,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:40:48,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:48,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509693790] [2021-12-14 11:40:48,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509693790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:48,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:48,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:40:48,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096959816] [2021-12-14 11:40:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:48,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:48,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:48,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:48,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:40:48,279 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:48,450 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2021-12-14 11:40:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:48,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-12-14 11:40:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:48,454 INFO L225 Difference]: With dead ends: 143 [2021-12-14 11:40:48,454 INFO L226 Difference]: Without dead ends: 105 [2021-12-14 11:40:48,454 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-12-14 11:40:48,457 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 85 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:48,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 156 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-14 11:40:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2021-12-14 11:40:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2021-12-14 11:40:48,462 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 18 [2021-12-14 11:40:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:48,463 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2021-12-14 11:40:48,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2021-12-14 11:40:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 11:40:48,463 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:48,463 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:48,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 11:40:48,464 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:48,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:48,464 INFO L85 PathProgramCache]: Analyzing trace with hash -640429161, now seen corresponding path program 1 times [2021-12-14 11:40:48,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:48,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961249512] [2021-12-14 11:40:48,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:40:48,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:48,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961249512] [2021-12-14 11:40:48,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961249512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:48,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:48,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:40:48,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346840498] [2021-12-14 11:40:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:48,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:40:48,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:48,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:40:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:48,526 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:48,533 INFO L93 Difference]: Finished difference Result 104 states and 156 transitions. [2021-12-14 11:40:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:40:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-12-14 11:40:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:48,534 INFO L225 Difference]: With dead ends: 104 [2021-12-14 11:40:48,534 INFO L226 Difference]: Without dead ends: 52 [2021-12-14 11:40:48,535 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-12-14 11:40:48,535 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:48,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-14 11:40:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-14 11:40:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 51 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-12-14 11:40:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2021-12-14 11:40:48,539 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 19 [2021-12-14 11:40:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:48,539 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2021-12-14 11:40:48,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2021-12-14 11:40:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 11:40:48,540 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:48,540 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] [2021-12-14 11:40:48,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 11:40:48,540 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2021-12-14 11:40:48,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:48,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605088938] [2021-12-14 11:40:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:48,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:48,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605088938] [2021-12-14 11:40:48,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605088938] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:48,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:48,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:40:48,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985998602] [2021-12-14 11:40:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:48,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:40:48,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:48,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:40:48,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:48,569 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:48,575 INFO L93 Difference]: Finished difference Result 73 states and 107 transitions. [2021-12-14 11:40:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:40:48,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-12-14 11:40:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:48,578 INFO L225 Difference]: With dead ends: 73 [2021-12-14 11:40:48,578 INFO L226 Difference]: Without dead ends: 62 [2021-12-14 11:40:48,578 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-12-14 11:40:48,578 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 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-12-14 11:40:48,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-14 11:40:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-14 11:40:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 61 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-12-14 11:40:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2021-12-14 11:40:48,582 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 25 [2021-12-14 11:40:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:48,582 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2021-12-14 11:40:48,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2021-12-14 11:40:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 11:40:48,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:48,583 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] [2021-12-14 11:40:48,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 11:40:48,583 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1738293938, now seen corresponding path program 1 times [2021-12-14 11:40:48,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:48,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564507242] [2021-12-14 11:40:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:48,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:48,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564507242] [2021-12-14 11:40:48,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564507242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:48,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:48,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:40:48,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481115479] [2021-12-14 11:40:48,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:48,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:48,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:48,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:48,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:40:48,674 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:48,805 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2021-12-14 11:40:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:48,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-12-14 11:40:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:48,807 INFO L225 Difference]: With dead ends: 169 [2021-12-14 11:40:48,807 INFO L226 Difference]: Without dead ends: 121 [2021-12-14 11:40:48,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:40:48,810 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 82 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:48,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 150 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-14 11:40:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 67. [2021-12-14 11:40:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 66 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2021-12-14 11:40:48,826 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 25 [2021-12-14 11:40:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:48,826 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2021-12-14 11:40:48,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2021-12-14 11:40:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:40:48,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:48,828 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] [2021-12-14 11:40:48,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 11:40:48,828 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1125876944, now seen corresponding path program 1 times [2021-12-14 11:40:48,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:48,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177051458] [2021-12-14 11:40:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:48,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:48,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177051458] [2021-12-14 11:40:48,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177051458] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:48,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088879106] [2021-12-14 11:40:48,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:48,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:48,889 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-12-14 11:40:48,890 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-12-14 11:40:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:40:48,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:49,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:49,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088879106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:49,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:40:49,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-14 11:40:49,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782314386] [2021-12-14 11:40:49,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:49,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:49,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:49,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:49,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:40:49,125 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:49,244 INFO L93 Difference]: Finished difference Result 153 states and 251 transitions. [2021-12-14 11:40:49,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:49,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-12-14 11:40:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:49,245 INFO L225 Difference]: With dead ends: 153 [2021-12-14 11:40:49,245 INFO L226 Difference]: Without dead ends: 119 [2021-12-14 11:40:49,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:40:49,246 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:49,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 59 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-14 11:40:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2021-12-14 11:40:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2021-12-14 11:40:49,255 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 26 [2021-12-14 11:40:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:49,255 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2021-12-14 11:40:49,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2021-12-14 11:40:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 11:40:49,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:49,259 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] [2021-12-14 11:40:49,285 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-12-14 11:40:49,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:49,475 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash 801426209, now seen corresponding path program 1 times [2021-12-14 11:40:49,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:49,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248286503] [2021-12-14 11:40:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:49,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:49,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:49,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248286503] [2021-12-14 11:40:49,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248286503] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:49,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575439832] [2021-12-14 11:40:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:49,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:49,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:49,578 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-12-14 11:40:49,579 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-12-14 11:40:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:49,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:40:49,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:40:49,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:49,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575439832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:49,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:40:49,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-14 11:40:49,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041296157] [2021-12-14 11:40:49,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:49,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:49,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:49,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:49,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:49,704 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:49,818 INFO L93 Difference]: Finished difference Result 244 states and 353 transitions. [2021-12-14 11:40:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:49,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-12-14 11:40:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:49,819 INFO L225 Difference]: With dead ends: 244 [2021-12-14 11:40:49,819 INFO L226 Difference]: Without dead ends: 161 [2021-12-14 11:40:49,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:49,820 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:49,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 89 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-14 11:40:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 132. [2021-12-14 11:40:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.297709923664122) internal successors, (170), 131 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 170 transitions. [2021-12-14 11:40:49,837 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 170 transitions. Word has length 32 [2021-12-14 11:40:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:49,837 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 170 transitions. [2021-12-14 11:40:49,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 170 transitions. [2021-12-14 11:40:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 11:40:49,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:49,838 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] [2021-12-14 11:40:49,855 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-12-14 11:40:50,040 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,SelfDestructingSolverStorable7 [2021-12-14 11:40:50,040 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash 745678486, now seen corresponding path program 1 times [2021-12-14 11:40:50,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:50,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044175899] [2021-12-14 11:40:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:50,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 11:40:50,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:50,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044175899] [2021-12-14 11:40:50,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044175899] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:50,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326906822] [2021-12-14 11:40:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:50,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:50,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:50,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 11:40:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:50,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:40:50,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 11:40:50,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:50,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326906822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:50,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:40:50,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-14 11:40:50,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412251136] [2021-12-14 11:40:50,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:50,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:50,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:50,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:50,286 INFO L87 Difference]: Start difference. First operand 132 states and 170 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:50,410 INFO L93 Difference]: Finished difference Result 303 states and 418 transitions. [2021-12-14 11:40:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:50,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 38 [2021-12-14 11:40:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:50,412 INFO L225 Difference]: With dead ends: 303 [2021-12-14 11:40:50,412 INFO L226 Difference]: Without dead ends: 191 [2021-12-14 11:40:50,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:50,413 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:50,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 93 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-14 11:40:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2021-12-14 11:40:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.26875) internal successors, (203), 160 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 203 transitions. [2021-12-14 11:40:50,418 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 203 transitions. Word has length 38 [2021-12-14 11:40:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:50,419 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 203 transitions. [2021-12-14 11:40:50,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2021-12-14 11:40:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 11:40:50,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:50,420 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-14 11:40:50,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:50,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:50,640 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1650574969, now seen corresponding path program 1 times [2021-12-14 11:40:50,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:50,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687673619] [2021-12-14 11:40:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:50,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 11:40:50,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:50,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687673619] [2021-12-14 11:40:50,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687673619] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:50,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195109861] [2021-12-14 11:40:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:50,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:50,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:50,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:50,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 11:40:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:50,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:40:50,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 11:40:50,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:50,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195109861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:51,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:40:51,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-12-14 11:40:51,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041452990] [2021-12-14 11:40:51,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:51,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:40:51,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:51,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:40:51,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:40:51,001 INFO L87 Difference]: Start difference. First operand 161 states and 203 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12-14 11:40:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:51,088 INFO L93 Difference]: Finished difference Result 315 states and 407 transitions. [2021-12-14 11:40:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:40:51,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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 44 [2021-12-14 11:40:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:51,091 INFO L225 Difference]: With dead ends: 315 [2021-12-14 11:40:51,091 INFO L226 Difference]: Without dead ends: 150 [2021-12-14 11:40:51,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:51,092 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:51,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 48 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-14 11:40:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2021-12-14 11:40:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 122 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-12-14 11:40:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2021-12-14 11:40:51,098 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 44 [2021-12-14 11:40:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:51,098 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2021-12-14 11:40:51,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12-14 11:40:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2021-12-14 11:40:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 11:40:51,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:51,100 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:51,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:51,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:51,320 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:51,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash -564670639, now seen corresponding path program 1 times [2021-12-14 11:40:51,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:51,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188645791] [2021-12-14 11:40:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:51,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-14 11:40:51,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:51,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188645791] [2021-12-14 11:40:51,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188645791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:51,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:51,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:40:51,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638619912] [2021-12-14 11:40:51,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:51,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:40:51,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:51,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:40:51,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:40:51,407 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12-14 11:40:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:51,572 INFO L93 Difference]: Finished difference Result 479 states and 594 transitions. [2021-12-14 11:40:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:40:51,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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 65 [2021-12-14 11:40:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:51,574 INFO L225 Difference]: With dead ends: 479 [2021-12-14 11:40:51,574 INFO L226 Difference]: Without dead ends: 372 [2021-12-14 11:40:51,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:40:51,575 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 147 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:51,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 222 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-12-14 11:40:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 123. [2021-12-14 11:40:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 122 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-12-14 11:40:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2021-12-14 11:40:51,580 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 65 [2021-12-14 11:40:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:51,580 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2021-12-14 11:40:51,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12-14 11:40:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2021-12-14 11:40:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 11:40:51,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:51,582 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:51,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 11:40:51,582 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1543642426, now seen corresponding path program 1 times [2021-12-14 11:40:51,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:51,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360670313] [2021-12-14 11:40:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:51,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-14 11:40:51,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:51,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360670313] [2021-12-14 11:40:51,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360670313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:51,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:51,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:40:51,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900754862] [2021-12-14 11:40:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:51,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:40:51,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:40:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:40:51,640 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:51,694 INFO L93 Difference]: Finished difference Result 384 states and 474 transitions. [2021-12-14 11:40:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:40:51,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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-12-14 11:40:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:51,696 INFO L225 Difference]: With dead ends: 384 [2021-12-14 11:40:51,696 INFO L226 Difference]: Without dead ends: 277 [2021-12-14 11:40:51,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:40:51,697 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 114 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:51,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 138 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-14 11:40:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 185. [2021-12-14 11:40:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.266304347826087) internal successors, (233), 184 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2021-12-14 11:40:51,718 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 66 [2021-12-14 11:40:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:51,719 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2021-12-14 11:40:51,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2021-12-14 11:40:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 11:40:51,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:51,720 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:51,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 11:40:51,720 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1373754372, now seen corresponding path program 1 times [2021-12-14 11:40:51,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:51,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418916202] [2021-12-14 11:40:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:51,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-14 11:40:51,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:51,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418916202] [2021-12-14 11:40:51,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418916202] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:51,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:51,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:40:51,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509124599] [2021-12-14 11:40:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:51,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:40:51,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:40:51,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:40:51,789 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-12-14 11:40:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:52,108 INFO L93 Difference]: Finished difference Result 942 states and 1171 transitions. [2021-12-14 11:40:52,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:40:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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 66 [2021-12-14 11:40:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:52,111 INFO L225 Difference]: With dead ends: 942 [2021-12-14 11:40:52,111 INFO L226 Difference]: Without dead ends: 773 [2021-12-14 11:40:52,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:40:52,112 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 297 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:52,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 422 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:40:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2021-12-14 11:40:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 178. [2021-12-14 11:40:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.271186440677966) internal successors, (225), 177 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 225 transitions. [2021-12-14 11:40:52,118 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 225 transitions. Word has length 66 [2021-12-14 11:40:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:52,118 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 225 transitions. [2021-12-14 11:40:52,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-12-14 11:40:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 225 transitions. [2021-12-14 11:40:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-14 11:40:52,119 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:52,119 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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-12-14 11:40:52,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 11:40:52,119 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:52,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1708732925, now seen corresponding path program 1 times [2021-12-14 11:40:52,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:52,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112319410] [2021-12-14 11:40:52,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:52,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-14 11:40:52,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:52,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112319410] [2021-12-14 11:40:52,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112319410] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:52,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7002378] [2021-12-14 11:40:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:52,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:52,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:52,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:52,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 11:40:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:52,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:40:52,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-14 11:40:52,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:40:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-14 11:40:52,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7002378] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:40:52,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:40:52,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-14 11:40:52,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950300245] [2021-12-14 11:40:52,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:40:52,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 11:40:52,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:52,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 11:40:52,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:40:52,590 INFO L87 Difference]: Start difference. First operand 178 states and 225 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:52,860 INFO L93 Difference]: Finished difference Result 848 states and 1116 transitions. [2021-12-14 11:40:52,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:40:52,860 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 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 68 [2021-12-14 11:40:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:52,862 INFO L225 Difference]: With dead ends: 848 [2021-12-14 11:40:52,862 INFO L226 Difference]: Without dead ends: 651 [2021-12-14 11:40:52,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:40:52,863 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 273 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:52,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 189 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:40:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-12-14 11:40:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 552. [2021-12-14 11:40:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.2885662431941924) internal successors, (710), 551 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 710 transitions. [2021-12-14 11:40:52,876 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 710 transitions. Word has length 68 [2021-12-14 11:40:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:52,876 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 710 transitions. [2021-12-14 11:40:52,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 710 transitions. [2021-12-14 11:40:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:40:52,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:52,877 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-12-14 11:40:52,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:53,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 11:40:53,088 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:53,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:53,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1373021230, now seen corresponding path program 1 times [2021-12-14 11:40:53,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:53,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163428340] [2021-12-14 11:40:53,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:53,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 11:40:53,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:53,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163428340] [2021-12-14 11:40:53,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163428340] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:53,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50185817] [2021-12-14 11:40:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:53,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:53,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:53,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:53,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 11:40:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:53,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-14 11:40:53,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 11:40:53,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:40:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 11:40:53,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50185817] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:40:53,711 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:40:53,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 13 [2021-12-14 11:40:53,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711739123] [2021-12-14 11:40:53,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:40:53,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 11:40:53,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:53,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 11:40:53,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-14 11:40:53,713 INFO L87 Difference]: Start difference. First operand 552 states and 710 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:53,991 INFO L93 Difference]: Finished difference Result 1342 states and 1665 transitions. [2021-12-14 11:40:53,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:40:53,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 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 70 [2021-12-14 11:40:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:53,994 INFO L225 Difference]: With dead ends: 1342 [2021-12-14 11:40:53,994 INFO L226 Difference]: Without dead ends: 813 [2021-12-14 11:40:53,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2021-12-14 11:40:53,995 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 287 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:53,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 417 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:40:54,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-12-14 11:40:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 497. [2021-12-14 11:40:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.2661290322580645) internal successors, (628), 496 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 628 transitions. [2021-12-14 11:40:54,017 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 628 transitions. Word has length 70 [2021-12-14 11:40:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:54,018 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 628 transitions. [2021-12-14 11:40:54,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 628 transitions. [2021-12-14 11:40:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:40:54,019 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:54,019 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-12-14 11:40:54,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:54,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 11:40:54,223 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:54,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 2 times [2021-12-14 11:40:54,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:54,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526571374] [2021-12-14 11:40:54,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:54,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 11:40:54,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 11:40:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 11:40:54,333 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 11:40:54,333 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 11:40:54,334 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:40:54,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 11:40:54,337 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:54,339 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 11:40:54,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:40:54 BoogieIcfgContainer [2021-12-14 11:40:54,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 11:40:54,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 11:40:54,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 11:40:54,412 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 11:40:54,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:47" (3/4) ... [2021-12-14 11:40:54,414 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 11:40:54,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 11:40:54,415 INFO L158 Benchmark]: Toolchain (without parser) took 7503.70ms. Allocated memory was 94.4MB in the beginning and 167.8MB in the end (delta: 73.4MB). Free memory was 66.7MB in the beginning and 99.7MB in the end (delta: -33.0MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2021-12-14 11:40:54,415 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 51.7MB in the beginning and 51.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:40:54,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.08ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 66.7MB in the beginning and 88.6MB in the end (delta: -21.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2021-12-14 11:40:54,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.44ms. Allocated memory is still 113.2MB. Free memory was 88.6MB in the beginning and 87.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:40:54,416 INFO L158 Benchmark]: Boogie Preprocessor took 38.81ms. Allocated memory is still 113.2MB. Free memory was 87.1MB in the beginning and 85.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:40:54,416 INFO L158 Benchmark]: RCFGBuilder took 307.47ms. Allocated memory is still 113.2MB. Free memory was 85.6MB in the beginning and 73.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 11:40:54,417 INFO L158 Benchmark]: TraceAbstraction took 6833.98ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 72.4MB in the beginning and 100.7MB in the end (delta: -28.3MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2021-12-14 11:40:54,417 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:40:54,422 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.17ms. Allocated memory is still 94.4MB. Free memory was 51.7MB in the beginning and 51.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.08ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 66.7MB in the beginning and 88.6MB in the end (delta: -21.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.44ms. Allocated memory is still 113.2MB. Free memory was 88.6MB in the beginning and 87.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.81ms. Allocated memory is still 113.2MB. Free memory was 87.1MB in the beginning and 85.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.47ms. Allocated memory is still 113.2MB. Free memory was 85.6MB in the beginning and 73.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6833.98ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 72.4MB in the beginning and 100.7MB in the end (delta: -28.3MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 25]: 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 116, overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=1, nb=4, partial_sum=20838, r0=234770790] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=234770790, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=255, \old(b)=234770789, \result=3, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r=3, r0=234770790, r1=82, r2=254, r3=13] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1548 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1548 mSDsluCounter, 2281 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1376 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2159 IncrementalHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 905 mSDtfsCounter, 2159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 428 SyntacticMatches, 10 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=14, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1547 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 934 NumberOfCodeBlocks, 934 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 979 ConstructedInterpolants, 0 QuantifiedInterpolants, 3806 SizeOfPredicates, 15 NumberOfNonLiveVariables, 839 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 775/810 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-12-14 11:40:54,442 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/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:40:56,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:40:56,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:40:56,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:40:56,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:40:56,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:40:56,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:40:56,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:40:56,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:40:56,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:40:56,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:40:56,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:40:56,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:40:56,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:40:56,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:40:56,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:40:56,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:40:56,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:40:56,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:40:56,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:40:56,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:40:56,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:40:56,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:40:56,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:40:56,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:40:56,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:40:56,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:40:56,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:40:56,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:40:56,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:40:56,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:40:56,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:40:56,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:40:56,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:40:56,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:40:56,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:40:56,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:40:56,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:40:56,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:40:56,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:40:56,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:40:56,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-14 11:40:56,148 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:40:56,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:40:56,149 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:40:56,149 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:40:56,150 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:40:56,150 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:40:56,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:40:56,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:40:56,151 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:40:56,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:40:56,151 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:40:56,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:40:56,152 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:40:56,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:40:56,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:40:56,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:40:56,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:40:56,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:40:56,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:40:56,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:40:56,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:40:56,153 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 11:40:56,153 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 11:40:56,154 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:40:56,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:40:56,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:40:56,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:40:56,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 11:40:56,154 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2021-12-14 11:40:56,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:40:56,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:40:56,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:40:56,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:40:56,411 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:40:56,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-14 11:40:56,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c578518/5c250224993c4ebc9505bddff0f03819/FLAG63a6a3baa [2021-12-14 11:40:56,801 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:40:56,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-14 11:40:56,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c578518/5c250224993c4ebc9505bddff0f03819/FLAG63a6a3baa [2021-12-14 11:40:56,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c578518/5c250224993c4ebc9505bddff0f03819 [2021-12-14 11:40:56,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:40:56,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:40:56,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:40:56,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:40:56,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:40:56,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:40:56" (1/1) ... [2021-12-14 11:40:56,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d66bc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:56, skipping insertion in model container [2021-12-14 11:40:56,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:40:56" (1/1) ... [2021-12-14 11:40:56,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:40:56,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:40:56,938 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/bitvector/byte_add_2-2.i[1168,1181] [2021-12-14 11:40:56,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:40:57,005 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:40:57,019 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/bitvector/byte_add_2-2.i[1168,1181] [2021-12-14 11:40:57,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:40:57,053 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:40:57,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57 WrapperNode [2021-12-14 11:40:57,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:40:57,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:40:57,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:40:57,056 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:40:57,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,100 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-14 11:40:57,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:40:57,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:40:57,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:40:57,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:40:57,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:40:57,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:40:57,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:40:57,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:40:57,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (1/1) ... [2021-12-14 11:40:57,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:40:57,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:57,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 11:40:57,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 11:40:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:40:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 11:40:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:40:57,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:40:57,259 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:40:57,260 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:40:57,472 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:40:57,476 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:40:57,480 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 11:40:57,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:57 BoogieIcfgContainer [2021-12-14 11:40:57,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:40:57,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:40:57,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:40:57,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:40:57,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:40:56" (1/3) ... [2021-12-14 11:40:57,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fb939b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:40:57, skipping insertion in model container [2021-12-14 11:40:57,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:57" (2/3) ... [2021-12-14 11:40:57,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fb939b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:40:57, skipping insertion in model container [2021-12-14 11:40:57,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:57" (3/3) ... [2021-12-14 11:40:57,486 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2021-12-14 11:40:57,489 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:40:57,489 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:40:57,522 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:40:57,526 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 11:40:57,527 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:40:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 11:40:57,538 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:57,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:57,539 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:57,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-14 11:40:57,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:40:57,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897518373] [2021-12-14 11:40:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:57,552 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:40:57,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:40:57,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:40:57,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 11:40:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:57,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 11:40:57,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:57,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:57,656 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:40:57,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897518373] [2021-12-14 11:40:57,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897518373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:57,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:57,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:40:57,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697658354] [2021-12-14 11:40:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:57,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:40:57,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:40:57,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:40:57,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:40:57,694 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:57,708 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-14 11:40:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:40:57,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 11:40:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:57,716 INFO L225 Difference]: With dead ends: 57 [2021-12-14 11:40:57,717 INFO L226 Difference]: Without dead ends: 38 [2021-12-14 11:40:57,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:40:57,721 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:57,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-14 11:40:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-14 11:40:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 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-12-14 11:40:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-14 11:40:57,752 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-14 11:40:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:57,752 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-14 11:40:57,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-14 11:40:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 11:40:57,753 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:57,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:57,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:57,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:40:57,960 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-14 11:40:57,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:40:57,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731886886] [2021-12-14 11:40:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:57,962 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:40:57,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:40:57,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:40:57,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 11:40:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:58,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:40:58,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:58,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:58,074 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:40:58,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731886886] [2021-12-14 11:40:58,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731886886] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:58,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:58,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:40:58,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326090527] [2021-12-14 11:40:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:58,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:58,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:40:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:58,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:40:58,077 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:58,258 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2021-12-14 11:40:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:58,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 11:40:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:58,260 INFO L225 Difference]: With dead ends: 116 [2021-12-14 11:40:58,260 INFO L226 Difference]: Without dead ends: 88 [2021-12-14 11:40:58,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-12-14 11:40:58,261 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:58,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 152 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:40:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-14 11:40:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2021-12-14 11:40:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-14 11:40:58,269 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2021-12-14 11:40:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:58,269 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-14 11:40:58,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-14 11:40:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 11:40:58,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:58,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:58,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-14 11:40:58,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:40:58,477 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:58,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2021-12-14 11:40:58,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:40:58,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674339481] [2021-12-14 11:40:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:58,478 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:40:58,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:40:58,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:40:58,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 11:40:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:58,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:40:58,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:58,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:58,574 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:40:58,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674339481] [2021-12-14 11:40:58,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674339481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:58,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:58,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:40:58,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977159641] [2021-12-14 11:40:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:58,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:40:58,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:40:58,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:40:58,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:58,583 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:58,589 INFO L93 Difference]: Finished difference Result 86 states and 134 transitions. [2021-12-14 11:40:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:40:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 11:40:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:58,590 INFO L225 Difference]: With dead ends: 86 [2021-12-14 11:40:58,590 INFO L226 Difference]: Without dead ends: 55 [2021-12-14 11:40:58,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12-14 11:40:58,591 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:58,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-14 11:40:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-14 11:40:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 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-12-14 11:40:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2021-12-14 11:40:58,596 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2021-12-14 11:40:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:58,596 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2021-12-14 11:40:58,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2021-12-14 11:40:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 11:40:58,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:58,597 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] [2021-12-14 11:40:58,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:58,807 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-12-14 11:40:58,808 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:58,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:58,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2021-12-14 11:40:58,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:40:58,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130597076] [2021-12-14 11:40:58,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:58,809 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:40:58,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:40:58,811 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-12-14 11:40:58,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 11:40:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:58,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:40:58,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:58,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:58,896 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:40:58,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130597076] [2021-12-14 11:40:58,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130597076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:58,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:58,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:40:58,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210336138] [2021-12-14 11:40:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:58,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:58,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:40:58,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:58,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:40:58,899 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:58,995 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2021-12-14 11:40:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:58,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-12-14 11:40:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:58,996 INFO L225 Difference]: With dead ends: 151 [2021-12-14 11:40:58,996 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 11:40:58,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-12-14 11:40:58,998 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:58,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 146 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 11:40:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2021-12-14 11:40:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2021-12-14 11:40:59,004 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 25 [2021-12-14 11:40:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:59,004 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2021-12-14 11:40:59,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2021-12-14 11:40:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:40:59,005 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:59,005 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] [2021-12-14 11:40:59,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:59,215 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-12-14 11:40:59,215 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2021-12-14 11:40:59,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:40:59,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541522855] [2021-12-14 11:40:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:59,217 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:40:59,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:40:59,219 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:40:59,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 11:40:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:59,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:40:59,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:59,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:59,326 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:40:59,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541522855] [2021-12-14 11:40:59,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541522855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:59,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:59,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:40:59,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789881219] [2021-12-14 11:40:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:59,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:40:59,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:40:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:40:59,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:40:59,328 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:59,402 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2021-12-14 11:40:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:40:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-12-14 11:40:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:59,404 INFO L225 Difference]: With dead ends: 201 [2021-12-14 11:40:59,404 INFO L226 Difference]: Without dead ends: 157 [2021-12-14 11:40:59,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:40:59,405 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 140 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:59,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 295 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-14 11:40:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 60. [2021-12-14 11:40:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2021-12-14 11:40:59,411 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 26 [2021-12-14 11:40:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:59,419 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2021-12-14 11:40:59,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2021-12-14 11:40:59,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 11:40:59,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:59,420 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] [2021-12-14 11:40:59,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:59,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:40:59,626 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1985045161, now seen corresponding path program 1 times [2021-12-14 11:40:59,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:40:59,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906207416] [2021-12-14 11:40:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:59,627 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:40:59,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:40:59,628 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:40:59,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 11:40:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:59,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:40:59,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:59,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:59,718 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:40:59,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906207416] [2021-12-14 11:40:59,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906207416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:59,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:59,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:40:59,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447196878] [2021-12-14 11:40:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:59,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:40:59,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:40:59,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:40:59,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:40:59,720 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:00,070 INFO L93 Difference]: Finished difference Result 269 states and 387 transitions. [2021-12-14 11:41:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:41:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-12-14 11:41:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:00,071 INFO L225 Difference]: With dead ends: 269 [2021-12-14 11:41:00,071 INFO L226 Difference]: Without dead ends: 221 [2021-12-14 11:41:00,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:41:00,072 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 357 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:00,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 462 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:41:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-14 11:41:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 57. [2021-12-14 11:41:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 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-12-14 11:41:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2021-12-14 11:41:00,078 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 27 [2021-12-14 11:41:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:00,078 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2021-12-14 11:41:00,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2021-12-14 11:41:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 11:41:00,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:00,079 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] [2021-12-14 11:41:00,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:00,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,285 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:00,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2021-12-14 11:41:00,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:00,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125884099] [2021-12-14 11:41:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:00,286 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:00,287 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:00,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 11:41:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:00,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:41:00,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:00,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:00,405 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:00,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125884099] [2021-12-14 11:41:00,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125884099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:00,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:00,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:41:00,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029731727] [2021-12-14 11:41:00,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:00,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:41:00,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:00,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:41:00,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:41:00,407 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:00,453 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2021-12-14 11:41:00,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:41:00,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-12-14 11:41:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:00,454 INFO L225 Difference]: With dead ends: 76 [2021-12-14 11:41:00,454 INFO L226 Difference]: Without dead ends: 60 [2021-12-14 11:41:00,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-12-14 11:41:00,455 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:00,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 62 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2021-12-14 11:41:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-14 11:41:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2021-12-14 11:41:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 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-12-14 11:41:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2021-12-14 11:41:00,460 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 29 [2021-12-14 11:41:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:00,464 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2021-12-14 11:41:00,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2021-12-14 11:41:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 11:41:00,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:00,465 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] [2021-12-14 11:41:00,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:00,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,666 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:00,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:00,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1944069515, now seen corresponding path program 1 times [2021-12-14 11:41:00,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:00,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091050651] [2021-12-14 11:41:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:00,670 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:00,671 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:00,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 11:41:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:00,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:41:00,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:00,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:00,795 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:00,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091050651] [2021-12-14 11:41:00,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091050651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:00,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:00,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:41:00,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952153836] [2021-12-14 11:41:00,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:00,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:41:00,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:00,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:41:00,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:41:00,797 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:00,851 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2021-12-14 11:41:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:41:00,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-12-14 11:41:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:00,852 INFO L225 Difference]: With dead ends: 140 [2021-12-14 11:41:00,852 INFO L226 Difference]: Without dead ends: 82 [2021-12-14 11:41:00,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:41:00,854 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 30 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:00,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 118 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 85 Unchecked, 0.0s Time] [2021-12-14 11:41:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-14 11:41:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-12-14 11:41:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2021-12-14 11:41:00,865 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 38 [2021-12-14 11:41:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:00,865 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2021-12-14 11:41:00,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2021-12-14 11:41:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 11:41:00,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:00,866 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] [2021-12-14 11:41:00,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:01,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:01,072 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:01,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1155801417, now seen corresponding path program 1 times [2021-12-14 11:41:01,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:01,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54503892] [2021-12-14 11:41:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:01,073 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:01,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:01,074 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:01,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 11:41:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:01,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:41:01,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:01,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:01,232 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:01,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54503892] [2021-12-14 11:41:01,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54503892] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:01,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:01,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:41:01,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338045800] [2021-12-14 11:41:01,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:01,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:41:01,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:01,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:41:01,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:41:01,233 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:01,269 INFO L93 Difference]: Finished difference Result 201 states and 268 transitions. [2021-12-14 11:41:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:41:01,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-12-14 11:41:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:01,270 INFO L225 Difference]: With dead ends: 201 [2021-12-14 11:41:01,270 INFO L226 Difference]: Without dead ends: 153 [2021-12-14 11:41:01,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:41:01,271 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 66 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:01,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 159 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2021-12-14 11:41:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-14 11:41:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 105. [2021-12-14 11:41:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2021-12-14 11:41:01,280 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2021-12-14 11:41:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:01,280 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2021-12-14 11:41:01,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2021-12-14 11:41:01,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 11:41:01,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:01,281 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] [2021-12-14 11:41:01,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:01,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:01,487 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:01,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1672266272, now seen corresponding path program 1 times [2021-12-14 11:41:01,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:01,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274718317] [2021-12-14 11:41:01,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:01,488 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:01,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:01,488 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:01,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 11:41:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:01,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:41:01,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:01,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:01,750 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:01,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274718317] [2021-12-14 11:41:01,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274718317] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:01,751 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:01,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-14 11:41:01,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171414480] [2021-12-14 11:41:01,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:01,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:41:01,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:41:01,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:41:01,752 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:01,921 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2021-12-14 11:41:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:41:01,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-14 11:41:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:01,922 INFO L225 Difference]: With dead ends: 230 [2021-12-14 11:41:01,922 INFO L226 Difference]: Without dead ends: 165 [2021-12-14 11:41:01,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:41:01,922 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 278 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:01,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 67 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-14 11:41:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 140. [2021-12-14 11:41:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 139 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 187 transitions. [2021-12-14 11:41:01,927 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 187 transitions. Word has length 40 [2021-12-14 11:41:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:01,927 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 187 transitions. [2021-12-14 11:41:01,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 187 transitions. [2021-12-14 11:41:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:41:01,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:01,929 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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-12-14 11:41:01,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:02,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:02,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:02,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1114855792, now seen corresponding path program 1 times [2021-12-14 11:41:02,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:02,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509471355] [2021-12-14 11:41:02,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:02,135 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:02,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:02,136 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:02,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 11:41:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:02,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:41:02,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 11:41:02,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 11:41:02,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:02,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509471355] [2021-12-14 11:41:02,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509471355] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:02,379 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:02,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-14 11:41:02,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869102942] [2021-12-14 11:41:02,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:02,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:41:02,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:02,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:41:02,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:41:02,380 INFO L87 Difference]: Start difference. First operand 140 states and 187 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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-12-14 11:41:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:02,532 INFO L93 Difference]: Finished difference Result 431 states and 586 transitions. [2021-12-14 11:41:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:41:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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 70 [2021-12-14 11:41:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:02,539 INFO L225 Difference]: With dead ends: 431 [2021-12-14 11:41:02,539 INFO L226 Difference]: Without dead ends: 324 [2021-12-14 11:41:02,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:41:02,540 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 227 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:02,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 340 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-14 11:41:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 203. [2021-12-14 11:41:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.386138613861386) internal successors, (280), 202 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 280 transitions. [2021-12-14 11:41:02,547 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 280 transitions. Word has length 70 [2021-12-14 11:41:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:02,547 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 280 transitions. [2021-12-14 11:41:02,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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-12-14 11:41:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 280 transitions. [2021-12-14 11:41:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:41:02,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:02,548 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-14 11:41:02,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:02,749 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-12-14 11:41:02,749 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash 343661932, now seen corresponding path program 1 times [2021-12-14 11:41:02,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:02,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138399390] [2021-12-14 11:41:02,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:02,750 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:02,751 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-12-14 11:41:02,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-14 11:41:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:02,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:41:02,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 11:41:02,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 11:41:03,047 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:03,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138399390] [2021-12-14 11:41:03,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138399390] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:03,047 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:03,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-12-14 11:41:03,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965111516] [2021-12-14 11:41:03,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:03,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:41:03,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:03,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:41:03,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:41:03,048 INFO L87 Difference]: Start difference. First operand 203 states and 280 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:03,159 INFO L93 Difference]: Finished difference Result 519 states and 706 transitions. [2021-12-14 11:41:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:41:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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 70 [2021-12-14 11:41:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:03,161 INFO L225 Difference]: With dead ends: 519 [2021-12-14 11:41:03,161 INFO L226 Difference]: Without dead ends: 349 [2021-12-14 11:41:03,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-12-14 11:41:03,162 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 265 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:03,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 265 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-12-14 11:41:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 206. [2021-12-14 11:41:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3853658536585365) internal successors, (284), 205 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 284 transitions. [2021-12-14 11:41:03,168 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 284 transitions. Word has length 70 [2021-12-14 11:41:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:03,168 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 284 transitions. [2021-12-14 11:41:03,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 284 transitions. [2021-12-14 11:41:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:41:03,169 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:03,169 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-12-14 11:41:03,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:03,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:03,375 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:03,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:03,375 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 2 times [2021-12-14 11:41:03,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:03,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341909230] [2021-12-14 11:41:03,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:41:03,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:03,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:03,377 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:03,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-14 11:41:03,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:41:03,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:41:03,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-14 11:41:03,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:05,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:07,822 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:07,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341909230] [2021-12-14 11:41:07,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341909230] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:07,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:07,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2021-12-14 11:41:07,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849089798] [2021-12-14 11:41:07,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:07,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-14 11:41:07,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:07,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-14 11:41:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2021-12-14 11:41:07,824 INFO L87 Difference]: Start difference. First operand 206 states and 284 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:19,007 INFO L93 Difference]: Finished difference Result 2094 states and 2890 transitions. [2021-12-14 11:41:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-12-14 11:41:19,008 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 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 70 [2021-12-14 11:41:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:19,013 INFO L225 Difference]: With dead ends: 2094 [2021-12-14 11:41:19,013 INFO L226 Difference]: Without dead ends: 1909 [2021-12-14 11:41:19,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2223, Invalid=10887, Unknown=0, NotChecked=0, Total=13110 [2021-12-14 11:41:19,017 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 2791 mSDsluCounter, 8276 mSDsCounter, 0 mSdLazyCounter, 4845 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2791 SdHoareTripleChecker+Valid, 8719 SdHoareTripleChecker+Invalid, 5339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 4845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:19,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2791 Valid, 8719 Invalid, 5339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 4845 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-12-14 11:41:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2021-12-14 11:41:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 842. [2021-12-14 11:41:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.4244946492271107) internal successors, (1198), 841 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1198 transitions. [2021-12-14 11:41:19,045 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1198 transitions. Word has length 70 [2021-12-14 11:41:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:19,045 INFO L470 AbstractCegarLoop]: Abstraction has 842 states and 1198 transitions. [2021-12-14 11:41:19,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1198 transitions. [2021-12-14 11:41:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:41:19,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:19,047 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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-12-14 11:41:19,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:19,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:19,253 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash 703065260, now seen corresponding path program 1 times [2021-12-14 11:41:19,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:19,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517482103] [2021-12-14 11:41:19,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:19,254 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:19,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:19,255 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:19,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-14 11:41:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:19,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:41:19,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 11:41:19,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 11:41:19,596 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:19,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517482103] [2021-12-14 11:41:19,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517482103] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:19,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:19,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-12-14 11:41:19,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958843834] [2021-12-14 11:41:19,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:19,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:41:19,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:19,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:41:19,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:41:19,597 INFO L87 Difference]: Start difference. First operand 842 states and 1198 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 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-12-14 11:41:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:19,733 INFO L93 Difference]: Finished difference Result 1711 states and 2443 transitions. [2021-12-14 11:41:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:41:19,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 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 70 [2021-12-14 11:41:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:19,737 INFO L225 Difference]: With dead ends: 1711 [2021-12-14 11:41:19,737 INFO L226 Difference]: Without dead ends: 908 [2021-12-14 11:41:19,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:41:19,738 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 33 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:19,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 85 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-12-14 11:41:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 738. [2021-12-14 11:41:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.383989145183175) internal successors, (1020), 737 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1020 transitions. [2021-12-14 11:41:19,764 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1020 transitions. Word has length 70 [2021-12-14 11:41:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:19,764 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 1020 transitions. [2021-12-14 11:41:19,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 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-12-14 11:41:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1020 transitions. [2021-12-14 11:41:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:41:19,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:19,767 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-12-14 11:41:19,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:19,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:19,977 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:19,978 INFO L85 PathProgramCache]: Analyzing trace with hash -247756884, now seen corresponding path program 1 times [2021-12-14 11:41:19,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:19,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610372684] [2021-12-14 11:41:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:19,978 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:19,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:19,979 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:19,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-14 11:41:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:20,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:41:20,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-14 11:41:20,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:20,149 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:20,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610372684] [2021-12-14 11:41:20,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610372684] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:20,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:20,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:41:20,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271759444] [2021-12-14 11:41:20,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:20,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:41:20,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:20,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:41:20,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:41:20,152 INFO L87 Difference]: Start difference. First operand 738 states and 1020 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:20,296 INFO L93 Difference]: Finished difference Result 1301 states and 1770 transitions. [2021-12-14 11:41:20,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:41:20,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 70 [2021-12-14 11:41:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:20,301 INFO L225 Difference]: With dead ends: 1301 [2021-12-14 11:41:20,301 INFO L226 Difference]: Without dead ends: 1131 [2021-12-14 11:41:20,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:41:20,303 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 149 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:20,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 432 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 82 Unchecked, 0.1s Time] [2021-12-14 11:41:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2021-12-14 11:41:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 732. [2021-12-14 11:41:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.387140902872777) internal successors, (1014), 731 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1014 transitions. [2021-12-14 11:41:20,325 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1014 transitions. Word has length 70 [2021-12-14 11:41:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:20,325 INFO L470 AbstractCegarLoop]: Abstraction has 732 states and 1014 transitions. [2021-12-14 11:41:20,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1014 transitions. [2021-12-14 11:41:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-14 11:41:20,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:20,327 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:20,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:20,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:20,537 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash 946149333, now seen corresponding path program 1 times [2021-12-14 11:41:20,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:20,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574547403] [2021-12-14 11:41:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:20,539 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:20,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:20,539 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:20,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-14 11:41:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:20,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:41:20,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 11:41:20,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 11:41:20,943 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:20,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574547403] [2021-12-14 11:41:20,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574547403] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:20,943 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:20,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-14 11:41:20,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437602381] [2021-12-14 11:41:20,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:20,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:41:20,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:41:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:41:20,944 INFO L87 Difference]: Start difference. First operand 732 states and 1014 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:21,110 INFO L93 Difference]: Finished difference Result 965 states and 1314 transitions. [2021-12-14 11:41:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:41:21,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 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-12-14 11:41:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:21,113 INFO L225 Difference]: With dead ends: 965 [2021-12-14 11:41:21,113 INFO L226 Difference]: Without dead ends: 795 [2021-12-14 11:41:21,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:41:21,114 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 83 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:21,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 170 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 167 Unchecked, 0.1s Time] [2021-12-14 11:41:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-12-14 11:41:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2021-12-14 11:41:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.3602015113350125) internal successors, (1080), 794 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1080 transitions. [2021-12-14 11:41:21,142 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1080 transitions. Word has length 72 [2021-12-14 11:41:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:21,142 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 1080 transitions. [2021-12-14 11:41:21,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1080 transitions. [2021-12-14 11:41:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-14 11:41:21,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:21,143 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:21,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:21,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:21,350 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:21,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:21,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1891529833, now seen corresponding path program 1 times [2021-12-14 11:41:21,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:21,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473233516] [2021-12-14 11:41:21,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:21,351 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:21,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:21,351 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:21,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-14 11:41:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:21,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:41:21,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 11:41:21,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 11:41:21,793 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:21,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473233516] [2021-12-14 11:41:21,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473233516] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:21,793 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:21,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-14 11:41:21,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745155855] [2021-12-14 11:41:21,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:21,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 11:41:21,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:21,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 11:41:21,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:41:21,794 INFO L87 Difference]: Start difference. First operand 795 states and 1080 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:21,974 INFO L93 Difference]: Finished difference Result 1307 states and 1765 transitions. [2021-12-14 11:41:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:41:21,975 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 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 73 [2021-12-14 11:41:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:21,977 INFO L225 Difference]: With dead ends: 1307 [2021-12-14 11:41:21,977 INFO L226 Difference]: Without dead ends: 1137 [2021-12-14 11:41:21,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:41:21,979 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 168 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 283 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:21,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 218 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 283 Unchecked, 0.1s Time] [2021-12-14 11:41:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2021-12-14 11:41:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 834. [2021-12-14 11:41:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 1.3457382953181272) internal successors, (1121), 833 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1121 transitions. [2021-12-14 11:41:22,013 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1121 transitions. Word has length 73 [2021-12-14 11:41:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:22,013 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1121 transitions. [2021-12-14 11:41:22,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1121 transitions. [2021-12-14 11:41:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-14 11:41:22,014 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:22,014 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:22,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:22,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:22,223 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 1 times [2021-12-14 11:41:22,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:22,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863774459] [2021-12-14 11:41:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:22,223 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:22,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:22,224 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:22,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-14 11:41:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:22,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-14 11:41:22,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:24,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:27,455 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:27,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863774459] [2021-12-14 11:41:27,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863774459] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:27,455 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:27,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2021-12-14 11:41:27,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096873815] [2021-12-14 11:41:27,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:27,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-14 11:41:27,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-14 11:41:27,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2021-12-14 11:41:27,461 INFO L87 Difference]: Start difference. First operand 834 states and 1121 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)