./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/loop-lit/gj2007.c.i.p+nlh-reducer.c -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 2b1624bcee836a6ef84f0c5a49c428b8da4ed56b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 11:01:04,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 11:01:04,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 11:01:04,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 11:01:04,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 11:01:04,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 11:01:04,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 11:01:04,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 11:01:04,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 11:01:04,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 11:01:04,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 11:01:04,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 11:01:04,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 11:01:04,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 11:01:04,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 11:01:04,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 11:01:04,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 11:01:04,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 11:01:04,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 11:01:04,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 11:01:04,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 11:01:04,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 11:01:04,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 11:01:04,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 11:01:04,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 11:01:04,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 11:01:04,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 11:01:04,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 11:01:04,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 11:01:04,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 11:01:04,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 11:01:04,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 11:01:04,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 11:01:04,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 11:01:04,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 11:01:04,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 11:01:04,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 11:01:04,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 11:01:04,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 11:01:04,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 11:01:04,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 11:01:04,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 11:01:04,393 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 11:01:04,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 11:01:04,394 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 11:01:04,394 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 11:01:04,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 11:01:04,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 11:01:04,395 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 11:01:04,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 11:01:04,396 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 11:01:04,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 11:01:04,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 11:01:04,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 11:01:04,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 11:01:04,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 11:01:04,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 11:01:04,397 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 11:01:04,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 11:01:04,397 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 11:01:04,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 11:01:04,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 11:01:04,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 11:01:04,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 11:01:04,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 11:01:04,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 11:01:04,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 11:01:04,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 11:01:04,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 11:01:04,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 11:01:04,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 11:01:04,407 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 11:01:04,407 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 -> 2b1624bcee836a6ef84f0c5a49c428b8da4ed56b [2021-08-29 11:01:04,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 11:01:04,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 11:01:04,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 11:01:04,661 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 11:01:04,662 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 11:01:04,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2021-08-29 11:01:04,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9ffa238/9d19ee550a0c4eaa9fcc1b6adc71251d/FLAGf532db4a0 [2021-08-29 11:01:05,111 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 11:01:05,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2021-08-29 11:01:05,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9ffa238/9d19ee550a0c4eaa9fcc1b6adc71251d/FLAGf532db4a0 [2021-08-29 11:01:05,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9ffa238/9d19ee550a0c4eaa9fcc1b6adc71251d [2021-08-29 11:01:05,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 11:01:05,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 11:01:05,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 11:01:05,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 11:01:05,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 11:01:05,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4fc3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05, skipping insertion in model container [2021-08-29 11:01:05,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 11:01:05,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 11:01:05,662 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2021-08-29 11:01:05,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 11:01:05,755 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 11:01:05,785 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2021-08-29 11:01:05,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 11:01:05,829 INFO L208 MainTranslator]: Completed translation [2021-08-29 11:01:05,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05 WrapperNode [2021-08-29 11:01:05,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 11:01:05,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 11:01:05,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 11:01:05,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 11:01:05,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 11:01:05,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 11:01:05,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 11:01:05,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 11:01:05,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 11:01:05,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 11:01:05,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 11:01:05,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 11:01:05,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (1/1) ... [2021-08-29 11:01:05,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 11:01:05,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 11:01:05,952 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-08-29 11:01:05,970 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-08-29 11:01:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 11:01:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 11:01:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 11:01:05,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 11:01:06,225 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 11:01:06,226 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-29 11:01:06,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 11:01:06 BoogieIcfgContainer [2021-08-29 11:01:06,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 11:01:06,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 11:01:06,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 11:01:06,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 11:01:06,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 11:01:05" (1/3) ... [2021-08-29 11:01:06,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dae410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 11:01:06, skipping insertion in model container [2021-08-29 11:01:06,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:01:05" (2/3) ... [2021-08-29 11:01:06,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dae410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 11:01:06, skipping insertion in model container [2021-08-29 11:01:06,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 11:01:06" (3/3) ... [2021-08-29 11:01:06,235 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2021-08-29 11:01:06,240 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 11:01:06,240 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 11:01:06,275 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 11:01:06,279 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, mConcurrency=FINITE_AUTOMATA, 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-08-29 11:01:06,280 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 11:01:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.971830985915493) internal successors, (280), 143 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-08-29 11:01:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:06,319 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:06,319 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:06,320 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:06,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1067704148, now seen corresponding path program 1 times [2021-08-29 11:01:06,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:06,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442628024] [2021-08-29 11:01:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:06,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:06,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:06,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442628024] [2021-08-29 11:01:06,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442628024] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:06,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:06,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 11:01:06,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833413672] [2021-08-29 11:01:06,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 11:01:06,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:06,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 11:01:06,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 11:01:06,592 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.971830985915493) internal successors, (280), 143 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) Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:07,045 INFO L93 Difference]: Finished difference Result 284 states and 554 transitions. [2021-08-29 11:01:07,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 11:01:07,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:07,058 INFO L225 Difference]: With dead ends: 284 [2021-08-29 11:01:07,058 INFO L226 Difference]: Without dead ends: 141 [2021-08-29 11:01:07,060 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.66ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 11:01:07,062 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 293.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.16ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 397.99ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:07,063 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 553 Unknown, 0 Unchecked, 4.16ms Time], IncrementalHoareTripleChecker [1 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 397.99ms Time] [2021-08-29 11:01:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-08-29 11:01:07,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-08-29 11:01:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2021-08-29 11:01:07,096 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 139 [2021-08-29 11:01:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:07,097 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2021-08-29 11:01:07,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2021-08-29 11:01:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:07,099 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:07,099 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:07,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 11:01:07,099 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:07,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:07,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1752580255, now seen corresponding path program 1 times [2021-08-29 11:01:07,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:07,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384368455] [2021-08-29 11:01:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:07,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:07,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:07,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384368455] [2021-08-29 11:01:07,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384368455] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:07,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:07,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 11:01:07,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575798394] [2021-08-29 11:01:07,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 11:01:07,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 11:01:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 11:01:07,168 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:07,575 INFO L93 Difference]: Finished difference Result 406 states and 605 transitions. [2021-08-29 11:01:07,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 11:01:07,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:07,581 INFO L225 Difference]: With dead ends: 406 [2021-08-29 11:01:07,581 INFO L226 Difference]: Without dead ends: 273 [2021-08-29 11:01:07,583 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.37ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 11:01:07,585 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 277.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.44ms SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 379.95ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:07,585 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 545 Unknown, 0 Unchecked, 2.44ms Time], IncrementalHoareTripleChecker [195 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 379.95ms Time] [2021-08-29 11:01:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-29 11:01:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-08-29 11:01:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.2536764705882353) internal successors, (341), 272 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 341 transitions. [2021-08-29 11:01:07,610 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 341 transitions. Word has length 139 [2021-08-29 11:01:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:07,612 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 341 transitions. [2021-08-29 11:01:07,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 341 transitions. [2021-08-29 11:01:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:07,616 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:07,617 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:07,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 11:01:07,618 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:07,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:07,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2041942551, now seen corresponding path program 1 times [2021-08-29 11:01:07,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:07,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108917208] [2021-08-29 11:01:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:07,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:07,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:07,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108917208] [2021-08-29 11:01:07,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108917208] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:07,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:07,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 11:01:07,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621556449] [2021-08-29 11:01:07,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 11:01:07,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:07,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 11:01:07,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-29 11:01:07,727 INFO L87 Difference]: Start difference. First operand 273 states and 341 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:08,027 INFO L93 Difference]: Finished difference Result 402 states and 470 transitions. [2021-08-29 11:01:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 11:01:08,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:08,030 INFO L225 Difference]: With dead ends: 402 [2021-08-29 11:01:08,030 INFO L226 Difference]: Without dead ends: 267 [2021-08-29 11:01:08,031 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.04ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-29 11:01:08,036 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 222.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.10ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 276.20ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:08,038 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 618 Unknown, 0 Unchecked, 1.10ms Time], IncrementalHoareTripleChecker [7 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 276.20ms Time] [2021-08-29 11:01:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-08-29 11:01:08,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2021-08-29 11:01:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.2481203007518797) internal successors, (332), 266 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 332 transitions. [2021-08-29 11:01:08,060 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 332 transitions. Word has length 139 [2021-08-29 11:01:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:08,060 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 332 transitions. [2021-08-29 11:01:08,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 332 transitions. [2021-08-29 11:01:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:08,062 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:08,062 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:08,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 11:01:08,062 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:08,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1527946145, now seen corresponding path program 1 times [2021-08-29 11:01:08,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:08,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739648177] [2021-08-29 11:01:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:08,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:08,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:08,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739648177] [2021-08-29 11:01:08,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739648177] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:08,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:08,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-29 11:01:08,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047038425] [2021-08-29 11:01:08,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 11:01:08,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:08,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 11:01:08,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-29 11:01:08,174 INFO L87 Difference]: Start difference. First operand 267 states and 332 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:08,443 INFO L93 Difference]: Finished difference Result 394 states and 459 transitions. [2021-08-29 11:01:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 11:01:08,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:08,446 INFO L225 Difference]: With dead ends: 394 [2021-08-29 11:01:08,446 INFO L226 Difference]: Without dead ends: 265 [2021-08-29 11:01:08,446 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.75ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-29 11:01:08,454 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 198.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.10ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 247.12ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:08,455 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 612 Unknown, 0 Unchecked, 1.10ms Time], IncrementalHoareTripleChecker [6 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 247.12ms Time] [2021-08-29 11:01:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-08-29 11:01:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-08-29 11:01:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.246212121212121) internal successors, (329), 264 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 329 transitions. [2021-08-29 11:01:08,466 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 329 transitions. Word has length 139 [2021-08-29 11:01:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:08,466 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 329 transitions. [2021-08-29 11:01:08,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 329 transitions. [2021-08-29 11:01:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:08,473 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:08,474 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:08,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 11:01:08,475 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:08,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:08,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1089183555, now seen corresponding path program 1 times [2021-08-29 11:01:08,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:08,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261718466] [2021-08-29 11:01:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:08,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:08,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:08,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261718466] [2021-08-29 11:01:08,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261718466] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:08,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:08,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-29 11:01:08,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646206371] [2021-08-29 11:01:08,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 11:01:08,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:08,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 11:01:08,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-29 11:01:08,603 INFO L87 Difference]: Start difference. First operand 265 states and 329 transitions. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:09,007 INFO L93 Difference]: Finished difference Result 386 states and 450 transitions. [2021-08-29 11:01:09,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 11:01:09,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:09,009 INFO L225 Difference]: With dead ends: 386 [2021-08-29 11:01:09,009 INFO L226 Difference]: Without dead ends: 259 [2021-08-29 11:01:09,010 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.87ms TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-29 11:01:09,010 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 311.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.10ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 381.48ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:09,010 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 794 Unknown, 0 Unchecked, 2.10ms Time], IncrementalHoareTripleChecker [14 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 381.48ms Time] [2021-08-29 11:01:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-29 11:01:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2021-08-29 11:01:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.2403100775193798) internal successors, (320), 258 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 320 transitions. [2021-08-29 11:01:09,018 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 320 transitions. Word has length 139 [2021-08-29 11:01:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:09,018 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 320 transitions. [2021-08-29 11:01:09,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 320 transitions. [2021-08-29 11:01:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:09,020 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:09,020 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:09,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 11:01:09,021 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:09,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash -41763050, now seen corresponding path program 1 times [2021-08-29 11:01:09,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:09,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402381364] [2021-08-29 11:01:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:09,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:09,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:09,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402381364] [2021-08-29 11:01:09,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402381364] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:09,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:09,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-29 11:01:09,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236769834] [2021-08-29 11:01:09,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-29 11:01:09,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-29 11:01:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-29 11:01:09,146 INFO L87 Difference]: Start difference. First operand 259 states and 320 transitions. Second operand has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:09,523 INFO L93 Difference]: Finished difference Result 374 states and 435 transitions. [2021-08-29 11:01:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 11:01:09,523 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:09,524 INFO L225 Difference]: With dead ends: 374 [2021-08-29 11:01:09,524 INFO L226 Difference]: Without dead ends: 253 [2021-08-29 11:01:09,524 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.27ms TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-29 11:01:09,525 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 284.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.12ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 354.87ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:09,525 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 962 Unknown, 0 Unchecked, 4.12ms Time], IncrementalHoareTripleChecker [20 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 354.87ms Time] [2021-08-29 11:01:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-08-29 11:01:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2021-08-29 11:01:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.2341269841269842) internal successors, (311), 252 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 311 transitions. [2021-08-29 11:01:09,530 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 311 transitions. Word has length 139 [2021-08-29 11:01:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:09,530 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 311 transitions. [2021-08-29 11:01:09,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 311 transitions. [2021-08-29 11:01:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:09,531 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:09,531 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:09,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 11:01:09,532 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:09,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:09,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1153200357, now seen corresponding path program 1 times [2021-08-29 11:01:09,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:09,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104246630] [2021-08-29 11:01:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:09,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:09,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:09,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104246630] [2021-08-29 11:01:09,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104246630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:09,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:09,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-29 11:01:09,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126472740] [2021-08-29 11:01:09,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-29 11:01:09,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-29 11:01:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2021-08-29 11:01:09,671 INFO L87 Difference]: Start difference. First operand 253 states and 311 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:09,909 INFO L93 Difference]: Finished difference Result 364 states and 422 transitions. [2021-08-29 11:01:09,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-29 11:01:09,911 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:09,912 INFO L225 Difference]: With dead ends: 364 [2021-08-29 11:01:09,913 INFO L226 Difference]: Without dead ends: 249 [2021-08-29 11:01:09,913 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.17ms TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2021-08-29 11:01:09,914 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 172.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.65ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 220.87ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:09,914 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 468 Unknown, 0 Unchecked, 1.65ms Time], IncrementalHoareTripleChecker [32 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 220.87ms Time] [2021-08-29 11:01:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-29 11:01:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-08-29 11:01:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.2298387096774193) internal successors, (305), 248 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 305 transitions. [2021-08-29 11:01:09,921 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 305 transitions. Word has length 139 [2021-08-29 11:01:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:09,922 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 305 transitions. [2021-08-29 11:01:09,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 305 transitions. [2021-08-29 11:01:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:09,923 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:09,924 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:09,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 11:01:09,924 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash -717830785, now seen corresponding path program 1 times [2021-08-29 11:01:09,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:09,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642382821] [2021-08-29 11:01:09,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:09,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:10,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:10,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642382821] [2021-08-29 11:01:10,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642382821] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:10,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:10,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 11:01:10,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389040360] [2021-08-29 11:01:10,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-29 11:01:10,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:10,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-29 11:01:10,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2021-08-29 11:01:10,087 INFO L87 Difference]: Start difference. First operand 249 states and 305 transitions. Second operand has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:10,352 INFO L93 Difference]: Finished difference Result 352 states and 408 transitions. [2021-08-29 11:01:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-29 11:01:10,352 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:10,353 INFO L225 Difference]: With dead ends: 352 [2021-08-29 11:01:10,353 INFO L226 Difference]: Without dead ends: 241 [2021-08-29 11:01:10,354 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.14ms TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2021-08-29 11:01:10,354 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 196.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.61ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 247.62ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:10,354 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 625 Unknown, 0 Unchecked, 1.61ms Time], IncrementalHoareTripleChecker [53 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 247.62ms Time] [2021-08-29 11:01:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-08-29 11:01:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-08-29 11:01:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.2208333333333334) internal successors, (293), 240 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2021-08-29 11:01:10,359 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 139 [2021-08-29 11:01:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:10,360 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2021-08-29 11:01:10,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2021-08-29 11:01:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:10,361 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:10,361 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:10,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 11:01:10,361 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1738769551, now seen corresponding path program 1 times [2021-08-29 11:01:10,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:10,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52294652] [2021-08-29 11:01:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:10,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:10,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:10,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52294652] [2021-08-29 11:01:10,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52294652] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:10,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:10,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-29 11:01:10,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332405350] [2021-08-29 11:01:10,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-29 11:01:10,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-29 11:01:10,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2021-08-29 11:01:10,566 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:10,865 INFO L93 Difference]: Finished difference Result 338 states and 390 transitions. [2021-08-29 11:01:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-29 11:01:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:10,867 INFO L225 Difference]: With dead ends: 338 [2021-08-29 11:01:10,867 INFO L226 Difference]: Without dead ends: 235 [2021-08-29 11:01:10,867 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 141.37ms TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2021-08-29 11:01:10,868 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 226.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.85ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 283.04ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:10,868 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 798 Unknown, 0 Unchecked, 1.85ms Time], IncrementalHoareTripleChecker [52 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 283.04ms Time] [2021-08-29 11:01:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-08-29 11:01:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-08-29 11:01:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.2136752136752136) internal successors, (284), 234 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-08-29 11:01:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 284 transitions. [2021-08-29 11:01:10,872 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 284 transitions. Word has length 139 [2021-08-29 11:01:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:10,872 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 284 transitions. [2021-08-29 11:01:10,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 284 transitions. [2021-08-29 11:01:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:10,873 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:10,873 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:10,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 11:01:10,874 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash -834827415, now seen corresponding path program 1 times [2021-08-29 11:01:10,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:10,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37005571] [2021-08-29 11:01:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:10,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:11,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:11,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37005571] [2021-08-29 11:01:11,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37005571] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:11,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:11,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-08-29 11:01:11,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637157518] [2021-08-29 11:01:11,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-29 11:01:11,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:11,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-29 11:01:11,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2021-08-29 11:01:11,078 INFO L87 Difference]: Start difference. First operand 235 states and 284 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:11,414 INFO L93 Difference]: Finished difference Result 330 states and 379 transitions. [2021-08-29 11:01:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-29 11:01:11,415 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:11,416 INFO L225 Difference]: With dead ends: 330 [2021-08-29 11:01:11,416 INFO L226 Difference]: Without dead ends: 233 [2021-08-29 11:01:11,416 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 145.89ms TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2021-08-29 11:01:11,417 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 243.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.16ms SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 310.65ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:11,417 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 931 Unknown, 0 Unchecked, 2.16ms Time], IncrementalHoareTripleChecker [57 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 310.65ms Time] [2021-08-29 11:01:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-29 11:01:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-08-29 11:01:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.2112068965517242) internal successors, (281), 232 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2021-08-29 11:01:11,422 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 139 [2021-08-29 11:01:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:11,422 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2021-08-29 11:01:11,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2021-08-29 11:01:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:11,424 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:11,424 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:11,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 11:01:11,424 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1868941195, now seen corresponding path program 1 times [2021-08-29 11:01:11,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:11,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512822189] [2021-08-29 11:01:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:11,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:11,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:11,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512822189] [2021-08-29 11:01:11,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512822189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:11,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:11,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-08-29 11:01:11,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910563558] [2021-08-29 11:01:11,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-29 11:01:11,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-29 11:01:11,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2021-08-29 11:01:11,697 INFO L87 Difference]: Start difference. First operand 233 states and 281 transitions. Second operand has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:11,977 INFO L93 Difference]: Finished difference Result 322 states and 370 transitions. [2021-08-29 11:01:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-29 11:01:11,977 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:11,978 INFO L225 Difference]: With dead ends: 322 [2021-08-29 11:01:11,978 INFO L226 Difference]: Without dead ends: 227 [2021-08-29 11:01:11,979 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 201.39ms TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2021-08-29 11:01:11,979 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 191.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 259.11ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:11,979 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 649 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [90 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 259.11ms Time] [2021-08-29 11:01:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-08-29 11:01:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-08-29 11:01:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.2035398230088497) internal successors, (272), 226 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-08-29 11:01:11,989 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 139 [2021-08-29 11:01:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:11,989 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-08-29 11:01:11,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-08-29 11:01:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:11,991 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:11,991 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:11,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 11:01:11,991 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:11,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1432066370, now seen corresponding path program 1 times [2021-08-29 11:01:11,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:11,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698249088] [2021-08-29 11:01:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:11,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:12,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:12,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698249088] [2021-08-29 11:01:12,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698249088] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:12,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:12,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-08-29 11:01:12,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446020197] [2021-08-29 11:01:12,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-29 11:01:12,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:12,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-29 11:01:12,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2021-08-29 11:01:12,284 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:12,583 INFO L93 Difference]: Finished difference Result 310 states and 355 transitions. [2021-08-29 11:01:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-29 11:01:12,584 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:12,585 INFO L225 Difference]: With dead ends: 310 [2021-08-29 11:01:12,585 INFO L226 Difference]: Without dead ends: 221 [2021-08-29 11:01:12,585 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 237.10ms TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2021-08-29 11:01:12,586 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 214.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.83ms SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 281.34ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:12,586 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 802 Unknown, 0 Unchecked, 1.83ms Time], IncrementalHoareTripleChecker [76 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 281.34ms Time] [2021-08-29 11:01:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-08-29 11:01:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2021-08-29 11:01:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.1954545454545455) internal successors, (263), 220 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 263 transitions. [2021-08-29 11:01:12,594 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 263 transitions. Word has length 139 [2021-08-29 11:01:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:12,594 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 263 transitions. [2021-08-29 11:01:12,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 263 transitions. [2021-08-29 11:01:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:12,595 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:12,596 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:12,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 11:01:12,596 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash -269817043, now seen corresponding path program 1 times [2021-08-29 11:01:12,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:12,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957566678] [2021-08-29 11:01:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:12,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:12,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:12,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957566678] [2021-08-29 11:01:12,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957566678] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:12,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:12,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-29 11:01:12,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275502154] [2021-08-29 11:01:12,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-29 11:01:12,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:12,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-29 11:01:12,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2021-08-29 11:01:12,922 INFO L87 Difference]: Start difference. First operand 221 states and 263 transitions. Second operand has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 31 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:13,235 INFO L93 Difference]: Finished difference Result 300 states and 342 transitions. [2021-08-29 11:01:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-29 11:01:13,236 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 31 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:13,238 INFO L225 Difference]: With dead ends: 300 [2021-08-29 11:01:13,238 INFO L226 Difference]: Without dead ends: 217 [2021-08-29 11:01:13,238 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 247.54ms TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2021-08-29 11:01:13,239 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 214.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.66ms SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 294.65ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:13,239 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 792 Unknown, 0 Unchecked, 1.66ms Time], IncrementalHoareTripleChecker [84 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 294.65ms Time] [2021-08-29 11:01:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-08-29 11:01:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-08-29 11:01:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.1898148148148149) internal successors, (257), 216 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2021-08-29 11:01:13,244 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 139 [2021-08-29 11:01:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:13,244 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2021-08-29 11:01:13,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 31 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2021-08-29 11:01:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:13,246 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:13,246 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:13,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 11:01:13,246 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash -295254777, now seen corresponding path program 1 times [2021-08-29 11:01:13,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:13,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358441175] [2021-08-29 11:01:13,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:13,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:13,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:13,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358441175] [2021-08-29 11:01:13,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358441175] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:13,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:13,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-29 11:01:13,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632073414] [2021-08-29 11:01:13,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-29 11:01:13,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:13,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-29 11:01:13,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2021-08-29 11:01:13,648 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 35 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:13,946 INFO L93 Difference]: Finished difference Result 288 states and 328 transitions. [2021-08-29 11:01:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-29 11:01:13,947 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 35 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:13,947 INFO L225 Difference]: With dead ends: 288 [2021-08-29 11:01:13,948 INFO L226 Difference]: Without dead ends: 209 [2021-08-29 11:01:13,948 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 314.51ms TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2021-08-29 11:01:13,948 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 215.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 279.10ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:13,949 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 719 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [97 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 279.10ms Time] [2021-08-29 11:01:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-29 11:01:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-08-29 11:01:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.1778846153846154) internal successors, (245), 208 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 245 transitions. [2021-08-29 11:01:13,952 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 245 transitions. Word has length 139 [2021-08-29 11:01:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:13,953 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 245 transitions. [2021-08-29 11:01:13,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 35 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2021-08-29 11:01:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:13,954 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:13,954 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:13,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 11:01:13,954 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1471149049, now seen corresponding path program 1 times [2021-08-29 11:01:13,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:13,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287499779] [2021-08-29 11:01:13,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:13,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:14,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:14,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287499779] [2021-08-29 11:01:14,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287499779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:14,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:14,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-08-29 11:01:14,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437272641] [2021-08-29 11:01:14,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-29 11:01:14,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:14,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-29 11:01:14,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2021-08-29 11:01:14,396 INFO L87 Difference]: Start difference. First operand 209 states and 245 transitions. Second operand has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 38 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:14,682 INFO L93 Difference]: Finished difference Result 274 states and 310 transitions. [2021-08-29 11:01:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-29 11:01:14,682 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 38 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:14,683 INFO L225 Difference]: With dead ends: 274 [2021-08-29 11:01:14,683 INFO L226 Difference]: Without dead ends: 203 [2021-08-29 11:01:14,684 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 375.48ms TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2021-08-29 11:01:14,685 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 207.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.25ms SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 267.37ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:14,685 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 810 Unknown, 0 Unchecked, 1.25ms Time], IncrementalHoareTripleChecker [126 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 267.37ms Time] [2021-08-29 11:01:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-08-29 11:01:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-08-29 11:01:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.1683168316831682) internal successors, (236), 202 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 236 transitions. [2021-08-29 11:01:14,689 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 236 transitions. Word has length 139 [2021-08-29 11:01:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:14,689 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 236 transitions. [2021-08-29 11:01:14,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 38 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 236 transitions. [2021-08-29 11:01:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:14,690 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:14,690 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:14,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 11:01:14,690 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2129031119, now seen corresponding path program 1 times [2021-08-29 11:01:14,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:14,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691560326] [2021-08-29 11:01:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:14,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:15,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:15,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691560326] [2021-08-29 11:01:15,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691560326] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:15,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:15,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-08-29 11:01:15,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021154305] [2021-08-29 11:01:15,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-08-29 11:01:15,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:15,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-29 11:01:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2021-08-29 11:01:15,155 INFO L87 Difference]: Start difference. First operand 203 states and 236 transitions. Second operand has 39 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 39 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:15,519 INFO L93 Difference]: Finished difference Result 266 states and 299 transitions. [2021-08-29 11:01:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-29 11:01:15,520 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 39 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:15,521 INFO L225 Difference]: With dead ends: 266 [2021-08-29 11:01:15,521 INFO L226 Difference]: Without dead ends: 201 [2021-08-29 11:01:15,521 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 388.26ms TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2021-08-29 11:01:15,522 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 275.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.39ms SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 347.09ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:15,522 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 1275 Unknown, 0 Unchecked, 1.39ms Time], IncrementalHoareTripleChecker [111 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 347.09ms Time] [2021-08-29 11:01:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-29 11:01:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-08-29 11:01:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.165) internal successors, (233), 200 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-08-29 11:01:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2021-08-29 11:01:15,525 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 139 [2021-08-29 11:01:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:15,526 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2021-08-29 11:01:15,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 39 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2021-08-29 11:01:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:15,526 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:15,527 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:15,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 11:01:15,527 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:15,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1672960723, now seen corresponding path program 1 times [2021-08-29 11:01:15,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:15,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659457083] [2021-08-29 11:01:15,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:15,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:16,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:16,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659457083] [2021-08-29 11:01:16,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659457083] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:16,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:16,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-08-29 11:01:16,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532846600] [2021-08-29 11:01:16,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-08-29 11:01:16,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-08-29 11:01:16,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2021-08-29 11:01:16,072 INFO L87 Difference]: Start difference. First operand 201 states and 233 transitions. Second operand has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 42 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:16,362 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2021-08-29 11:01:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-29 11:01:16,363 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 42 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:16,363 INFO L225 Difference]: With dead ends: 258 [2021-08-29 11:01:16,363 INFO L226 Difference]: Without dead ends: 195 [2021-08-29 11:01:16,364 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 474.65ms TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2021-08-29 11:01:16,364 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 215.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.23ms SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 274.24ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:16,365 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 884 Unknown, 0 Unchecked, 1.23ms Time], IncrementalHoareTripleChecker [127 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 274.24ms Time] [2021-08-29 11:01:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-29 11:01:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-08-29 11:01:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.1546391752577319) internal successors, (224), 194 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2021-08-29 11:01:16,368 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 139 [2021-08-29 11:01:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:16,369 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 224 transitions. [2021-08-29 11:01:16,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 42 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2021-08-29 11:01:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:16,369 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:16,370 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:16,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 11:01:16,370 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:16,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:16,370 INFO L82 PathProgramCache]: Analyzing trace with hash -371842202, now seen corresponding path program 1 times [2021-08-29 11:01:16,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:16,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864263623] [2021-08-29 11:01:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:16,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:17,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:17,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864263623] [2021-08-29 11:01:17,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864263623] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:17,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:17,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-08-29 11:01:17,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604695356] [2021-08-29 11:01:17,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-08-29 11:01:17,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:17,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-08-29 11:01:17,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2021-08-29 11:01:17,011 INFO L87 Difference]: Start difference. First operand 195 states and 224 transitions. Second operand has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:17,268 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2021-08-29 11:01:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-29 11:01:17,269 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:17,269 INFO L225 Difference]: With dead ends: 246 [2021-08-29 11:01:17,269 INFO L226 Difference]: Without dead ends: 189 [2021-08-29 11:01:17,270 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 567.19ms TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2021-08-29 11:01:17,270 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 192.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.04ms SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 239.49ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:17,270 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 0 Invalid, 711 Unknown, 0 Unchecked, 1.04ms Time], IncrementalHoareTripleChecker [183 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 239.49ms Time] [2021-08-29 11:01:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-08-29 11:01:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-08-29 11:01:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.1436170212765957) internal successors, (215), 188 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2021-08-29 11:01:17,274 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 139 [2021-08-29 11:01:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:17,274 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2021-08-29 11:01:17,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2021-08-29 11:01:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:17,275 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:17,275 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:17,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-29 11:01:17,275 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:17,275 INFO L82 PathProgramCache]: Analyzing trace with hash 941521525, now seen corresponding path program 1 times [2021-08-29 11:01:17,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:17,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801813815] [2021-08-29 11:01:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:17,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:17,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:17,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801813815] [2021-08-29 11:01:17,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801813815] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:17,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:17,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-08-29 11:01:17,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406985537] [2021-08-29 11:01:17,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-08-29 11:01:17,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:17,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-08-29 11:01:17,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2021-08-29 11:01:17,944 INFO L87 Difference]: Start difference. First operand 189 states and 215 transitions. Second operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 47 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:18,253 INFO L93 Difference]: Finished difference Result 236 states and 262 transitions. [2021-08-29 11:01:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-29 11:01:18,254 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 47 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:18,255 INFO L225 Difference]: With dead ends: 236 [2021-08-29 11:01:18,255 INFO L226 Difference]: Without dead ends: 185 [2021-08-29 11:01:18,255 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 569.14ms TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2021-08-29 11:01:18,256 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 221.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.43ms SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 286.46ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:18,256 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 974 Unknown, 0 Unchecked, 1.43ms Time], IncrementalHoareTripleChecker [218 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 286.46ms Time] [2021-08-29 11:01:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-29 11:01:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-08-29 11:01:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.1358695652173914) internal successors, (209), 184 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2021-08-29 11:01:18,260 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 139 [2021-08-29 11:01:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:18,260 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2021-08-29 11:01:18,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 47 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2021-08-29 11:01:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:18,261 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:18,261 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:18,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-29 11:01:18,262 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash 566614415, now seen corresponding path program 1 times [2021-08-29 11:01:18,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:18,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694515869] [2021-08-29 11:01:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:18,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:19,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:19,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694515869] [2021-08-29 11:01:19,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694515869] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:19,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:19,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-08-29 11:01:19,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182292673] [2021-08-29 11:01:19,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-08-29 11:01:19,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-08-29 11:01:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2021-08-29 11:01:19,025 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:19,340 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2021-08-29 11:01:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-29 11:01:19,341 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:19,341 INFO L225 Difference]: With dead ends: 224 [2021-08-29 11:01:19,341 INFO L226 Difference]: Without dead ends: 177 [2021-08-29 11:01:19,342 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 674.88ms TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2021-08-29 11:01:19,343 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 234.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.24ms SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 296.87ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:19,343 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 1042 Unknown, 0 Unchecked, 1.24ms Time], IncrementalHoareTripleChecker [140 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 296.87ms Time] [2021-08-29 11:01:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-29 11:01:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-08-29 11:01:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.1193181818181819) internal successors, (197), 176 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2021-08-29 11:01:19,346 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 139 [2021-08-29 11:01:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:19,346 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2021-08-29 11:01:19,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2021-08-29 11:01:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:19,347 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:19,347 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:19,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-29 11:01:19,348 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:19,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:19,348 INFO L82 PathProgramCache]: Analyzing trace with hash 325265535, now seen corresponding path program 1 times [2021-08-29 11:01:19,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:19,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895089481] [2021-08-29 11:01:19,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:19,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:20,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:20,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895089481] [2021-08-29 11:01:20,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895089481] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:20,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:20,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-29 11:01:20,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384300627] [2021-08-29 11:01:20,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-08-29 11:01:20,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-29 11:01:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2021-08-29 11:01:20,249 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand has 53 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 53 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:20,575 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2021-08-29 11:01:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-29 11:01:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 53 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:20,576 INFO L225 Difference]: With dead ends: 212 [2021-08-29 11:01:20,576 INFO L226 Difference]: Without dead ends: 143 [2021-08-29 11:01:20,577 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 808.88ms TimeCoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2021-08-29 11:01:20,577 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 195 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 242.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.87ms SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 298.65ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:20,577 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 0 Invalid, 914 Unknown, 0 Unchecked, 1.87ms Time], IncrementalHoareTripleChecker [193 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 298.65ms Time] [2021-08-29 11:01:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-29 11:01:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2021-08-29 11:01:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2021-08-29 11:01:20,581 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 139 [2021-08-29 11:01:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:20,581 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2021-08-29 11:01:20,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 53 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2021-08-29 11:01:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 11:01:20,582 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:20,582 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:20,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-29 11:01:20,582 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:20,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2012640870, now seen corresponding path program 1 times [2021-08-29 11:01:20,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:20,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329316687] [2021-08-29 11:01:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:20,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:21,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:21,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329316687] [2021-08-29 11:01:21,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329316687] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:21,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:21,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-08-29 11:01:21,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89158951] [2021-08-29 11:01:21,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2021-08-29 11:01:21,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:21,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-08-29 11:01:21,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2021-08-29 11:01:21,982 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 70 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:22,345 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2021-08-29 11:01:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-08-29 11:01:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 70 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2021-08-29 11:01:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:22,347 INFO L225 Difference]: With dead ends: 182 [2021-08-29 11:01:22,347 INFO L226 Difference]: Without dead ends: 143 [2021-08-29 11:01:22,348 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1292.29ms TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2021-08-29 11:01:22,349 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 253.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.99ms SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 329.56ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:22,349 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 1014 Unknown, 0 Unchecked, 2.99ms Time], IncrementalHoareTripleChecker [264 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 329.56ms Time] [2021-08-29 11:01:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-29 11:01:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-08-29 11:01:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.0070921985815602) internal successors, (142), 141 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2021-08-29 11:01:22,353 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2021-08-29 11:01:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:22,354 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2021-08-29 11:01:22,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 70 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2021-08-29 11:01:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-08-29 11:01:22,355 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:22,355 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:22,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-29 11:01:22,355 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1420118316, now seen corresponding path program 1 times [2021-08-29 11:01:22,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:22,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082699816] [2021-08-29 11:01:22,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:22,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:23,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:23,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082699816] [2021-08-29 11:01:23,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082699816] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 11:01:23,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675006691] [2021-08-29 11:01:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:23,749 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 11:01:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 11:01:23,749 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-08-29 11:01:23,750 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-08-29 11:01:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:23,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 70 conjunts are in the unsatisfiable core [2021-08-29 11:01:23,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 11:01:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:24,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 11:01:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:25,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675006691] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 11:01:25,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 11:01:25,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 103 [2021-08-29 11:01:25,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861253999] [2021-08-29 11:01:25,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2021-08-29 11:01:25,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:25,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2021-08-29 11:01:25,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2021-08-29 11:01:25,979 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand has 103 states, 103 states have (on average 2.737864077669903) internal successors, (282), 103 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:26,394 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2021-08-29 11:01:26,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-08-29 11:01:26,395 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.737864077669903) internal successors, (282), 103 states have internal predecessors, (282), 0 states have call successors, (0), 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 141 [2021-08-29 11:01:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:26,396 INFO L225 Difference]: With dead ends: 209 [2021-08-29 11:01:26,396 INFO L226 Difference]: Without dead ends: 206 [2021-08-29 11:01:26,397 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2776.92ms TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2021-08-29 11:01:26,398 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 311 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 267.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.08ms SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 358.53ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:26,398 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 0 Invalid, 1136 Unknown, 0 Unchecked, 3.08ms Time], IncrementalHoareTripleChecker [308 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 358.53ms Time] [2021-08-29 11:01:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-08-29 11:01:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-08-29 11:01:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.0048780487804878) internal successors, (206), 205 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2021-08-29 11:01:26,402 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 141 [2021-08-29 11:01:26,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:26,403 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2021-08-29 11:01:26,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.737864077669903) internal successors, (282), 103 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2021-08-29 11:01:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-08-29 11:01:26,404 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:26,404 INFO L513 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:26,425 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-08-29 11:01:26,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-29 11:01:26,629 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:26,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1334769172, now seen corresponding path program 2 times [2021-08-29 11:01:26,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:26,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961771388] [2021-08-29 11:01:26,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:26,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:27,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:27,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961771388] [2021-08-29 11:01:27,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961771388] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 11:01:27,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510936026] [2021-08-29 11:01:27,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 11:01:27,826 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 11:01:27,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 11:01:27,836 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-08-29 11:01:27,837 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-08-29 11:01:27,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 11:01:27,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 11:01:27,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 105 conjunts are in the unsatisfiable core [2021-08-29 11:01:27,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 11:01:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:28,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 11:01:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:29,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510936026] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 11:01:29,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 11:01:29,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2021-08-29 11:01:29,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485798510] [2021-08-29 11:01:29,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-08-29 11:01:29,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:29,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-08-29 11:01:29,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2021-08-29 11:01:29,573 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand has 55 states, 55 states have (on average 3.7636363636363637) internal successors, (207), 55 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:32,587 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2021-08-29 11:01:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-29 11:01:32,588 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.7636363636363637) internal successors, (207), 55 states have internal predecessors, (207), 0 states have call successors, (0), 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 205 [2021-08-29 11:01:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:32,588 INFO L225 Difference]: With dead ends: 212 [2021-08-29 11:01:32,589 INFO L226 Difference]: Without dead ends: 209 [2021-08-29 11:01:32,589 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 404 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1152.53ms TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2021-08-29 11:01:32,589 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 7856 mSDsCounter, 0 mSdLazyCounter, 10769 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2393.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.57ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2919.17ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:32,589 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 10769 Unknown, 0 Unchecked, 18.57ms Time], IncrementalHoareTripleChecker [0 Valid, 10769 Invalid, 0 Unknown, 0 Unchecked, 2919.17ms Time] [2021-08-29 11:01:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-29 11:01:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2021-08-29 11:01:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.0048309178743962) internal successors, (208), 207 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2021-08-29 11:01:32,593 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2021-08-29 11:01:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:32,594 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2021-08-29 11:01:32,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.7636363636363637) internal successors, (207), 55 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2021-08-29 11:01:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-08-29 11:01:32,595 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 11:01:32,595 INFO L513 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-29 11:01:32,615 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-08-29 11:01:32,795 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,SelfDestructingSolverStorable23 [2021-08-29 11:01:32,795 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 11:01:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 11:01:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1489572658, now seen corresponding path program 3 times [2021-08-29 11:01:32,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 11:01:32,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906858488] [2021-08-29 11:01:32,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 11:01:32,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 11:01:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 11:01:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 11:01:33,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 11:01:33,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906858488] [2021-08-29 11:01:33,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906858488] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 11:01:33,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 11:01:33,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-08-29 11:01:33,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724804250] [2021-08-29 11:01:33,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-08-29 11:01:33,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 11:01:33,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-08-29 11:01:33,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2021-08-29 11:01:33,679 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand has 52 states, 52 states have (on average 3.980769230769231) internal successors, (207), 52 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 11:01:33,929 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2021-08-29 11:01:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-08-29 11:01:33,929 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.980769230769231) internal successors, (207), 52 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2021-08-29 11:01:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 11:01:33,930 INFO L225 Difference]: With dead ends: 208 [2021-08-29 11:01:33,930 INFO L226 Difference]: Without dead ends: 0 [2021-08-29 11:01:33,931 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 770.65ms TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2021-08-29 11:01:33,931 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 181.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.68ms SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 230.19ms IncrementalHoareTripleChecker+Time [2021-08-29 11:01:33,931 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 639 Unknown, 0 Unchecked, 0.68ms Time], IncrementalHoareTripleChecker [62 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 230.19ms Time] [2021-08-29 11:01:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-29 11:01:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-29 11:01:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-29 11:01:33,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2021-08-29 11:01:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 11:01:33,932 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-29 11:01:33,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.980769230769231) internal successors, (207), 52 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 11:01:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-29 11:01:33,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-29 11:01:33,935 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 11:01:33,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-29 11:01:33,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-29 11:01:33,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:33,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 11:01:34,783 INFO L854 garLoopResultBuilder]: At program point L927(lines 181 928) the Hoare annotation is: (and (<= 28 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 28) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,783 INFO L854 garLoopResultBuilder]: At program point L795(lines 247 796) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 39) (<= 39 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,783 INFO L854 garLoopResultBuilder]: At program point L663(lines 313 664) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 50 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 50) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,783 INFO L854 garLoopResultBuilder]: At program point L531(lines 379 532) the Hoare annotation is: (and (<= 61 ULTIMATE.start_main_~main__x~0) (<= 61 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 61) (<= ULTIMATE.start_main_~main__y~0 61)) [2021-08-29 11:01:34,783 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 556) no Hoare annotation was computed. [2021-08-29 11:01:34,783 INFO L858 garLoopResultBuilder]: For program point L301(lines 301 688) no Hoare annotation was computed. [2021-08-29 11:01:34,783 INFO L858 garLoopResultBuilder]: For program point L235(lines 235 820) no Hoare annotation was computed. [2021-08-29 11:01:34,783 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 952) no Hoare annotation was computed. [2021-08-29 11:01:34,783 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 1084) no Hoare annotation was computed. [2021-08-29 11:01:34,783 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 1216) no Hoare annotation was computed. [2021-08-29 11:01:34,783 INFO L854 garLoopResultBuilder]: At program point L1227(lines 31 1228) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 3) (<= 3 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,783 INFO L854 garLoopResultBuilder]: At program point L1095(lines 97 1096) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 14 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 14) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,783 INFO L854 garLoopResultBuilder]: At program point L963(lines 163 964) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 25 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 25) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,783 INFO L854 garLoopResultBuilder]: At program point L831(lines 229 832) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 36) (<= 36 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,784 INFO L854 garLoopResultBuilder]: At program point L699(lines 295 700) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 47) (<= 47 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,784 INFO L854 garLoopResultBuilder]: At program point L567(lines 361 568) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) [2021-08-29 11:01:34,784 INFO L858 garLoopResultBuilder]: For program point L403(lines 403 484) no Hoare annotation was computed. [2021-08-29 11:01:34,784 INFO L858 garLoopResultBuilder]: For program point L337(lines 337 616) no Hoare annotation was computed. [2021-08-29 11:01:34,784 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 748) no Hoare annotation was computed. [2021-08-29 11:01:34,784 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 880) no Hoare annotation was computed. [2021-08-29 11:01:34,784 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 1012) no Hoare annotation was computed. [2021-08-29 11:01:34,784 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 1144) no Hoare annotation was computed. [2021-08-29 11:01:34,784 INFO L854 garLoopResultBuilder]: At program point L1131(lines 79 1132) the Hoare annotation is: (and (<= 11 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 11) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,784 INFO L854 garLoopResultBuilder]: At program point L999(lines 145 1000) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 22 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 22) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,784 INFO L854 garLoopResultBuilder]: At program point L867(lines 211 868) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 33) (<= 33 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,784 INFO L854 garLoopResultBuilder]: At program point L735(lines 277 736) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 44) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 44 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,784 INFO L854 garLoopResultBuilder]: At program point L603(lines 343 604) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 55) (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__y~0) (<= 55 ULTIMATE.start_main_~main__x~0)) [2021-08-29 11:01:34,785 INFO L854 garLoopResultBuilder]: At program point L471(lines 409 472) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 66) (<= 66 ULTIMATE.start_main_~main__x~0) (<= 66 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 66)) [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 544) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L307(lines 307 676) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 808) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 940) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 1072) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 1204) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L854 garLoopResultBuilder]: At program point L1167(lines 61 1168) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 8) (<= 8 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,785 INFO L854 garLoopResultBuilder]: At program point L1035(lines 127 1036) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 19) (<= 19 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,785 INFO L854 garLoopResultBuilder]: At program point L903(lines 193 904) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 30 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 30) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,785 INFO L854 garLoopResultBuilder]: At program point L771(lines 259 772) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 41) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 41 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,785 INFO L854 garLoopResultBuilder]: At program point L639(lines 325 640) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 52) (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 52)) [2021-08-29 11:01:34,785 INFO L854 garLoopResultBuilder]: At program point L507(lines 391 508) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 63) (<= 63 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0)) [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L442(lines 442 451) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 472) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 604) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L277(lines 277 736) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L211(lines 211 868) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 1000) no Hoare annotation was computed. [2021-08-29 11:01:34,785 INFO L858 garLoopResultBuilder]: For program point L79(lines 79 1132) no Hoare annotation was computed. [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L1203(lines 43 1204) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 5) (<= 5 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L1071(lines 109 1072) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 16 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 16) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L939(lines 175 940) the Hoare annotation is: (and (<= 27 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= ULTIMATE.start_main_~main__x~0 27)) [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L807(lines 241 808) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 38) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 38 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L675(lines 307 676) the Hoare annotation is: (and (<= 49 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= ULTIMATE.start_main_~main__x~0 49)) [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L543(lines 373 544) the Hoare annotation is: (and (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60) (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60)) [2021-08-29 11:01:34,786 INFO L858 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2021-08-29 11:01:34,786 INFO L858 garLoopResultBuilder]: For program point L379(lines 379 532) no Hoare annotation was computed. [2021-08-29 11:01:34,786 INFO L858 garLoopResultBuilder]: For program point L313(lines 313 664) no Hoare annotation was computed. [2021-08-29 11:01:34,786 INFO L858 garLoopResultBuilder]: For program point L247(lines 247 796) no Hoare annotation was computed. [2021-08-29 11:01:34,786 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 928) no Hoare annotation was computed. [2021-08-29 11:01:34,786 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 1060) no Hoare annotation was computed. [2021-08-29 11:01:34,786 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 1192) no Hoare annotation was computed. [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L1239(lines 25 1240) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 2) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= 2 ULTIMATE.start_main_~main__x~0)) [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L1107(lines 91 1108) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 13) (<= ULTIMATE.start_main_~main__y~0 50) (<= 13 ULTIMATE.start_main_~main__x~0)) [2021-08-29 11:01:34,786 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 1257) no Hoare annotation was computed. [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L975(lines 157 976) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 24 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 24) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L843(lines 223 844) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 35) (<= 35 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,786 INFO L854 garLoopResultBuilder]: At program point L711(lines 289 712) the Hoare annotation is: (and (<= 46 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 46) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,787 INFO L854 garLoopResultBuilder]: At program point L579(lines 355 580) the Hoare annotation is: (and (<= 57 ULTIMATE.start_main_~main__y~0) (<= 57 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L415(lines 415 460) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L349(lines 349 592) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 724) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L217(lines 217 856) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 988) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 1120) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 1252) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L854 garLoopResultBuilder]: At program point L1143(lines 73 1144) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 10) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 10 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,787 INFO L854 garLoopResultBuilder]: At program point L1011(lines 139 1012) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 21 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 21) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,787 INFO L854 garLoopResultBuilder]: At program point L879(lines 205 880) the Hoare annotation is: (and (<= 32 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 32) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,787 INFO L854 garLoopResultBuilder]: At program point L747(lines 271 748) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 43) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 43 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,787 INFO L854 garLoopResultBuilder]: At program point L615(lines 337 616) the Hoare annotation is: (and (<= 54 ULTIMATE.start_main_~main__x~0) (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= ULTIMATE.start_main_~main__x~0 54)) [2021-08-29 11:01:34,787 INFO L854 garLoopResultBuilder]: At program point L483(lines 403 484) the Hoare annotation is: (and (<= 65 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 65) (<= ULTIMATE.start_main_~main__y~0 65) (<= 65 ULTIMATE.start_main_~main__y~0)) [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L385(lines 385 520) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 652) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 784) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 916) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 1048) no Hoare annotation was computed. [2021-08-29 11:01:34,787 INFO L858 garLoopResultBuilder]: For program point L55(lines 55 1180) no Hoare annotation was computed. [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L1179(lines 55 1180) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 7) (<= 7 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L1047(lines 121 1048) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 18) (<= ULTIMATE.start_main_~main__y~0 50) (<= 18 ULTIMATE.start_main_~main__x~0)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L915(lines 187 916) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 29) (<= 29 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L783(lines 253 784) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 40) (<= ULTIMATE.start_main_~main__y~0 50) (<= 40 ULTIMATE.start_main_~main__x~0)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L651(lines 319 652) the Hoare annotation is: (and (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 51) (<= 51 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 51)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L519(lines 385 520) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 62) (<= ULTIMATE.start_main_~main__y~0 62) (<= 62 ULTIMATE.start_main_~main__x~0) (<= 62 ULTIMATE.start_main_~main__y~0)) [2021-08-29 11:01:34,788 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 580) no Hoare annotation was computed. [2021-08-29 11:01:34,788 INFO L858 garLoopResultBuilder]: For program point L289(lines 289 712) no Hoare annotation was computed. [2021-08-29 11:01:34,788 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-29 11:01:34,788 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 844) no Hoare annotation was computed. [2021-08-29 11:01:34,788 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 976) no Hoare annotation was computed. [2021-08-29 11:01:34,788 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 1108) no Hoare annotation was computed. [2021-08-29 11:01:34,788 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 1240) no Hoare annotation was computed. [2021-08-29 11:01:34,788 INFO L858 garLoopResultBuilder]: For program point L422(lines 422 433) no Hoare annotation was computed. [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L1215(lines 37 1216) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 4 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 4) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L1083(lines 103 1084) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 15) (<= 15 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L951(lines 169 952) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 26) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 26 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L819(lines 235 820) the Hoare annotation is: (and (<= 37 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 37) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L687(lines 301 688) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 48 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 48) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,788 INFO L854 garLoopResultBuilder]: At program point L555(lines 367 556) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0) (<= 59 ULTIMATE.start_main_~main__y~0)) [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point L391(lines 391 508) no Hoare annotation was computed. [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 640) no Hoare annotation was computed. [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 772) no Hoare annotation was computed. [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 904) no Hoare annotation was computed. [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 1036) no Hoare annotation was computed. [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 1168) no Hoare annotation was computed. [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-29 11:01:34,789 INFO L854 garLoopResultBuilder]: At program point L1251(lines 19 1252) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 1) (<= 1 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,789 INFO L854 garLoopResultBuilder]: At program point L1119(lines 85 1120) the Hoare annotation is: (and (<= 12 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 12) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,789 INFO L854 garLoopResultBuilder]: At program point L987(lines 151 988) the Hoare annotation is: (and (<= 23 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= ULTIMATE.start_main_~main__x~0 23)) [2021-08-29 11:01:34,789 INFO L854 garLoopResultBuilder]: At program point L855(lines 217 856) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 34) (<= 34 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,789 INFO L854 garLoopResultBuilder]: At program point L723(lines 283 724) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 45) (<= 45 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,789 INFO L854 garLoopResultBuilder]: At program point L591(lines 349 592) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 56) (<= 56 ULTIMATE.start_main_~main__y~0) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 56)) [2021-08-29 11:01:34,789 INFO L854 garLoopResultBuilder]: At program point L459(lines 415 460) the Hoare annotation is: (or (and (<= 99 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 99) (<= 99 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 100)) (and (<= 90 ULTIMATE.start_main_~main__x~0) (<= 90 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 90) (< ULTIMATE.start_main_~main__x~0 91)) (and (< ULTIMATE.start_main_~main__x~0 89) (<= ULTIMATE.start_main_~main__y~0 88) (<= 88 ULTIMATE.start_main_~main__x~0) (<= 88 ULTIMATE.start_main_~main__y~0)) (and (<= 96 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 97) (<= 96 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 96)) (and (< ULTIMATE.start_main_~main__x~0 76) (<= ULTIMATE.start_main_~main__y~0 75) (<= 75 ULTIMATE.start_main_~main__y~0) (<= 75 ULTIMATE.start_main_~main__x~0)) (and (< ULTIMATE.start_main_~main__x~0 70) (<= 69 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 69) (<= 69 ULTIMATE.start_main_~main__x~0)) (and (< ULTIMATE.start_main_~main__x~0 80) (<= 79 ULTIMATE.start_main_~main__y~0) (<= 79 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 79)) (and (<= 84 ULTIMATE.start_main_~main__y~0) (<= 84 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 84) (< ULTIMATE.start_main_~main__x~0 85)) (and (<= 70 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 71) (<= ULTIMATE.start_main_~main__y~0 70) (<= 70 ULTIMATE.start_main_~main__x~0)) (and (<= 71 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 72) (<= ULTIMATE.start_main_~main__y~0 71) (<= 71 ULTIMATE.start_main_~main__y~0)) (and (<= 98 ULTIMATE.start_main_~main__y~0) (<= 98 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 98) (< ULTIMATE.start_main_~main__x~0 99)) (and (<= 94 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 94) (< ULTIMATE.start_main_~main__x~0 95) (<= 94 ULTIMATE.start_main_~main__y~0)) (and (<= 81 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 81) (<= 81 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 82)) (and (<= 100 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 100) (< 99 ULTIMATE.start_main_~main__y~0)) (and (<= 77 ULTIMATE.start_main_~main__x~0) (<= 77 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 77) (< ULTIMATE.start_main_~main__x~0 78)) (and (<= 85 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 86) (<= 85 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 85)) (and (<= ULTIMATE.start_main_~main__y~0 83) (< ULTIMATE.start_main_~main__x~0 84) (<= 83 ULTIMATE.start_main_~main__x~0) (<= 83 ULTIMATE.start_main_~main__y~0)) (and (<= 82 ULTIMATE.start_main_~main__y~0) (<= 82 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 82) (< ULTIMATE.start_main_~main__x~0 83)) (and (< ULTIMATE.start_main_~main__x~0 73) (<= ULTIMATE.start_main_~main__y~0 72) (<= 72 ULTIMATE.start_main_~main__y~0) (<= 72 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__y~0 80) (< ULTIMATE.start_main_~main__x~0 81) (<= 80 ULTIMATE.start_main_~main__x~0) (<= 80 ULTIMATE.start_main_~main__y~0)) (and (< ULTIMATE.start_main_~main__x~0 93) (<= ULTIMATE.start_main_~main__y~0 92) (<= 92 ULTIMATE.start_main_~main__x~0) (<= 92 ULTIMATE.start_main_~main__y~0)) (and (<= 97 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 97) (<= 97 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 98)) (and (< ULTIMATE.start_main_~main__x~0 92) (<= 91 ULTIMATE.start_main_~main__y~0) (<= 91 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 91)) (and (<= 89 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 90) (<= ULTIMATE.start_main_~main__y~0 89) (<= 89 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 74) (< ULTIMATE.start_main_~main__x~0 75) (<= 74 ULTIMATE.start_main_~main__x~0) (<= 74 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__x~0 67) (<= 67 ULTIMATE.start_main_~main__x~0) (<= 67 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 67)) (and (< ULTIMATE.start_main_~main__x~0 88) (<= ULTIMATE.start_main_~main__y~0 87) (<= 87 ULTIMATE.start_main_~main__y~0) (<= 87 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__y~0 78) (<= 78 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 79) (<= 78 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 68) (<= ULTIMATE.start_main_~main__x~0 68) (<= 68 ULTIMATE.start_main_~main__x~0) (<= 68 ULTIMATE.start_main_~main__y~0)) (and (< ULTIMATE.start_main_~main__x~0 96) (<= 95 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 95) (<= 95 ULTIMATE.start_main_~main__y~0)) (and (< ULTIMATE.start_main_~main__x~0 77) (<= 76 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 76) (<= 76 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 86) (<= 86 ULTIMATE.start_main_~main__x~0) (<= 86 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 87)) (and (< ULTIMATE.start_main_~main__x~0 94) (<= 93 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 93) (<= 93 ULTIMATE.start_main_~main__y~0)) (and (< ULTIMATE.start_main_~main__x~0 74) (<= 73 ULTIMATE.start_main_~main__y~0) (<= 73 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 73))) [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 568) no Hoare annotation was computed. [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point L295(lines 295 700) no Hoare annotation was computed. [2021-08-29 11:01:34,789 INFO L858 garLoopResultBuilder]: For program point L229(lines 229 832) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 964) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L97(lines 97 1096) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 1228) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L854 garLoopResultBuilder]: At program point L1155(lines 67 1156) the Hoare annotation is: (and (<= 9 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 9) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L854 garLoopResultBuilder]: At program point L1023(lines 133 1024) the Hoare annotation is: (and (<= 20 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 20) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,790 INFO L854 garLoopResultBuilder]: At program point L891(lines 199 892) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 31) (<= 31 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 444) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L854 garLoopResultBuilder]: At program point L759(lines 265 760) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 42 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 42) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,790 INFO L854 garLoopResultBuilder]: At program point L627(lines 331 628) the Hoare annotation is: (and (<= 53 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 53)) [2021-08-29 11:01:34,790 INFO L854 garLoopResultBuilder]: At program point L495(lines 397 496) the Hoare annotation is: (and (<= 64 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 64) (<= 64 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 64)) [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L397(lines 397 496) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L331(lines 331 628) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L265(lines 265 760) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L861 garLoopResultBuilder]: At program point L1256(lines 13 1258) the Hoare annotation is: true [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 892) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 1024) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L858 garLoopResultBuilder]: For program point L67(lines 67 1156) no Hoare annotation was computed. [2021-08-29 11:01:34,790 INFO L854 garLoopResultBuilder]: At program point L1191(lines 49 1192) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 6) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 6 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,791 INFO L854 garLoopResultBuilder]: At program point L1059(lines 115 1060) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 17 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 17) (<= ULTIMATE.start_main_~main__y~0 50)) [2021-08-29 11:01:34,793 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 11:01:34,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 11:01:34 BoogieIcfgContainer [2021-08-29 11:01:34,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 11:01:34,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 11:01:34,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 11:01:34,819 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 11:01:34,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 11:01:06" (3/4) ... [2021-08-29 11:01:34,821 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-29 11:01:34,832 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-29 11:01:34,832 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-29 11:01:34,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-29 11:01:34,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-29 11:01:34,875 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 11:01:34,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 11:01:34,876 INFO L158 Benchmark]: Toolchain (without parser) took 29395.14ms. Allocated memory was 65.0MB in the beginning and 130.0MB in the end (delta: 65.0MB). Free memory was 47.8MB in the beginning and 87.6MB in the end (delta: -39.8MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2021-08-29 11:01:34,876 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 47.5MB in the end (delta: 52.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 11:01:34,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.46ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 44.5MB in the end (delta: 3.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-08-29 11:01:34,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.58ms. Allocated memory is still 65.0MB. Free memory was 44.3MB in the beginning and 41.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 11:01:34,877 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 65.0MB. Free memory was 41.5MB in the beginning and 39.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 11:01:34,877 INFO L158 Benchmark]: RCFGBuilder took 307.06ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 39.4MB in the beginning and 65.8MB in the end (delta: -26.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2021-08-29 11:01:34,877 INFO L158 Benchmark]: TraceAbstraction took 28588.29ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 65.3MB in the beginning and 99.1MB in the end (delta: -33.8MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2021-08-29 11:01:34,878 INFO L158 Benchmark]: Witness Printer took 56.91ms. Allocated memory is still 130.0MB. Free memory was 99.1MB in the beginning and 87.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-29 11:01:34,879 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.15ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 47.5MB in the end (delta: 52.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.46ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 44.5MB in the end (delta: 3.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.58ms. Allocated memory is still 65.0MB. Free memory was 44.3MB in the beginning and 41.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 65.0MB. Free memory was 41.5MB in the beginning and 39.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.06ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 39.4MB in the beginning and 65.8MB in the end (delta: -26.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 28588.29ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 65.3MB in the beginning and 99.1MB in the end (delta: -33.8MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Witness Printer took 56.91ms. Allocated memory is still 130.0MB. Free memory was 99.1MB in the beginning and 87.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 444]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28519.94ms, OverallIterations: 25, TraceHistogramMax: 34, EmptinessCheckTime: 46.83ms, AutomataDifference: 10897.27ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 847.28ms, InitialAbstractionConstructionTime: 20.96ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2360 SdHoareTripleChecker+Valid, 10061.61ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2360 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 7950.09ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8078 mSDsCounter, 2516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27520 IncrementalHoareTripleChecker+Invalid, 30036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2516 mSolverCounterUnsat, 0 mSDtfsCounter, 27520 mSolverCounterSat, 64.01ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1493 GetRequests, 699 SyntacticMatches, 6 SemanticMatches, 788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 11413.95ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=2, InterpolantAutomatonStates: 835, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 168.89ms AutomataMinimizationTime, 25 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 169 NumberOfFragments, 1299 HoareAnnotationTreeSize, 68 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 87.90ms HoareSimplificationTime, 68 FomulaSimplificationsInter, 297 FormulaSimplificationTreeSizeReductionInter, 749.27ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 93.23ms SsaConstructionTime, 556.67ms SatisfiabilityAnalysisTime, 15169.68ms InterpolantComputationTime, 3957 NumberOfCodeBlocks, 3957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4274 ConstructedInterpolants, 0 QuantifiedInterpolants, 11249 SizeOfPredicates, 2 NumberOfNonLiveVariables, 902 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 1156/4426 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 8) && 8 <= main__x) && main__y <= 50 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 31) && 31 <= main__x) && main__y <= 50 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 39) && 39 <= main__x) && main__y <= 50 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((main__x <= 35 && 35 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((main__x <= 38 && 50 <= main__y) && 38 <= main__x) && main__y <= 50 - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((54 <= main__x && 54 <= main__y) && main__y <= 54) && main__x <= 54 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((50 <= main__y && 16 <= main__x) && main__x <= 16) && main__y <= 50 - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((99 <= main__y && main__y <= 99) && 99 <= main__x) && main__x < 100) || (((90 <= main__x && 90 <= main__y) && main__y <= 90) && main__x < 91)) || (((main__x < 89 && main__y <= 88) && 88 <= main__x) && 88 <= main__y)) || (((96 <= main__y && main__x < 97) && 96 <= main__x) && main__y <= 96)) || (((main__x < 76 && main__y <= 75) && 75 <= main__y) && 75 <= main__x)) || (((main__x < 70 && 69 <= main__y) && main__y <= 69) && 69 <= main__x)) || (((main__x < 80 && 79 <= main__y) && 79 <= main__x) && main__y <= 79)) || (((84 <= main__y && 84 <= main__x) && main__y <= 84) && main__x < 85)) || (((70 <= main__y && main__x < 71) && main__y <= 70) && 70 <= main__x)) || (((71 <= main__x && main__x < 72) && main__y <= 71) && 71 <= main__y)) || (((98 <= main__y && 98 <= main__x) && main__y <= 98) && main__x < 99)) || (((94 <= main__x && main__y <= 94) && main__x < 95) && 94 <= main__y)) || (((81 <= main__x && main__y <= 81) && 81 <= main__y) && main__x < 82)) || ((100 <= main__x && main__y <= 100) && 99 < main__y)) || (((77 <= main__x && 77 <= main__y) && main__y <= 77) && main__x < 78)) || (((85 <= main__x && main__x < 86) && 85 <= main__y) && main__y <= 85)) || (((main__y <= 83 && main__x < 84) && 83 <= main__x) && 83 <= main__y)) || (((82 <= main__y && 82 <= main__x) && main__y <= 82) && main__x < 83)) || (((main__x < 73 && main__y <= 72) && 72 <= main__y) && 72 <= main__x)) || (((main__y <= 80 && main__x < 81) && 80 <= main__x) && 80 <= main__y)) || (((main__x < 93 && main__y <= 92) && 92 <= main__x) && 92 <= main__y)) || (((97 <= main__y && main__y <= 97) && 97 <= main__x) && main__x < 98)) || (((main__x < 92 && 91 <= main__y) && 91 <= main__x) && main__y <= 91)) || (((89 <= main__x && main__x < 90) && main__y <= 89) && 89 <= main__y)) || (((main__y <= 74 && main__x < 75) && 74 <= main__x) && 74 <= main__y)) || (((main__x <= 67 && 67 <= main__x) && 67 <= main__y) && main__y <= 67)) || (((main__x < 88 && main__y <= 87) && 87 <= main__y) && 87 <= main__x)) || (((main__y <= 78 && 78 <= main__x) && main__x < 79) && 78 <= main__y)) || (((main__y <= 68 && main__x <= 68) && 68 <= main__x) && 68 <= main__y)) || (((main__x < 96 && 95 <= main__x) && main__y <= 95) && 95 <= main__y)) || (((main__x < 77 && 76 <= main__x) && main__y <= 76) && 76 <= main__y)) || (((main__y <= 86 && 86 <= main__x) && 86 <= main__y) && main__x < 87)) || (((main__x < 94 && 93 <= main__x) && main__y <= 93) && 93 <= main__y)) || (((main__x < 74 && 73 <= main__y) && 73 <= main__x) && main__y <= 73) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((50 <= main__y && 4 <= main__x) && main__x <= 4) && main__y <= 50 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 40) && main__y <= 50) && 40 <= main__x - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: ((57 <= main__y && 57 <= main__x) && main__x <= 57) && main__y <= 57 - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((main__x <= 43 && 50 <= main__y) && 43 <= main__x) && main__y <= 50 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 13) && main__y <= 50) && 13 <= main__x - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((28 <= main__x && 50 <= main__y) && main__x <= 28) && main__y <= 50 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 34) && 34 <= main__x) && main__y <= 50 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((main__x <= 10 && 50 <= main__y) && 10 <= main__x) && main__y <= 50 - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((50 <= main__y && 21 <= main__x) && main__x <= 21) && main__y <= 50 - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((50 <= main__y && 50 <= main__x) && main__x <= 50) && main__y <= 50 - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((main__x <= 62 && main__y <= 62) && 62 <= main__x) && 62 <= main__y - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 5) && 5 <= main__x) && main__y <= 50 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: ((32 <= main__x && 50 <= main__y) && main__x <= 32) && main__y <= 50 - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: ((main__x <= 63 && 63 <= main__y) && main__y <= 63) && 63 <= main__x - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((9 <= main__x && main__x <= 9) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: ((64 <= main__x && main__x <= 64) && 64 <= main__y) && main__y <= 64 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 36) && 36 <= main__x) && main__y <= 50 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 15) && 15 <= main__x) && main__y <= 50 - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 29) && 29 <= main__x) && main__y <= 50 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((12 <= main__x && main__x <= 12) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 409]: Loop Invariant Derived loop invariant: ((main__x <= 66 && 66 <= main__x) && 66 <= main__y) && main__y <= 66 - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((23 <= main__x && 50 <= main__y) && main__y <= 50) && main__x <= 23 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((20 <= main__x && 50 <= main__y) && main__x <= 20) && main__y <= 50 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((main__x <= 41 && 50 <= main__y) && 41 <= main__x) && main__y <= 50 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((50 <= main__y && 25 <= main__x) && main__x <= 25) && main__y <= 50 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((50 <= main__y && 30 <= main__x) && main__x <= 30) && main__y <= 50 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((main__x <= 26 && 50 <= main__y) && 26 <= main__x) && main__y <= 50 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((65 <= main__x && main__x <= 65) && main__y <= 65) && 65 <= main__y - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((50 <= main__y && 42 <= main__x) && main__x <= 42) && main__y <= 50 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((main__y <= 52 && 52 <= main__y) && 52 <= main__x) && main__x <= 52 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((main__x <= 19 && 19 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ((61 <= main__x && 61 <= main__y) && main__x <= 61) && main__y <= 61 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 33) && 33 <= main__x) && main__y <= 50 - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((46 <= main__x && 50 <= main__y) && main__x <= 46) && main__y <= 50 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 47) && 47 <= main__x) && main__y <= 50 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((50 <= main__y && 24 <= main__x) && main__x <= 24) && main__y <= 50 - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: ((main__y <= 56 && 56 <= main__y) && 56 <= main__x) && main__x <= 56 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((main__x <= 58 && 58 <= main__x) && main__y <= 58) && 58 <= main__y - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 7) && 7 <= main__x) && main__y <= 50 - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((60 <= main__x && main__y <= 60) && 60 <= main__y) && main__x <= 60 - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((37 <= main__x && 50 <= main__y) && main__x <= 37) && main__y <= 50 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((main__x <= 2 && 50 <= main__y) && main__y <= 50) && 2 <= main__x - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((51 <= main__y && main__y <= 51) && 51 <= main__x) && main__x <= 51 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((50 <= main__y && 17 <= main__x) && main__x <= 17) && main__y <= 50 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((50 <= main__y && 22 <= main__x) && main__x <= 22) && main__y <= 50 - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: ((main__y <= 55 && main__x <= 55) && 55 <= main__y) && 55 <= main__x - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((main__x <= 6 && 50 <= main__y) && 6 <= main__x) && main__y <= 50 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 3) && 3 <= main__x) && main__y <= 50 - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((50 <= main__y && 48 <= main__x) && main__x <= 48) && main__y <= 50 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((53 <= main__x && main__y <= 53) && 53 <= main__y) && main__x <= 53 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((50 <= main__y && 14 <= main__x) && main__x <= 14) && main__y <= 50 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__x <= 44 && 50 <= main__y) && 44 <= main__x) && main__y <= 50 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((main__y <= 59 && main__x <= 59) && 59 <= main__x) && 59 <= main__y - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((11 <= main__x && 50 <= main__y) && main__x <= 11) && main__y <= 50 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 45) && 45 <= main__x) && main__y <= 50 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 18) && main__y <= 50) && 18 <= main__x - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((main__x <= 1 && 1 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((49 <= main__x && 50 <= main__y) && main__y <= 50) && main__x <= 49 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((27 <= main__x && 50 <= main__y) && main__y <= 50) && main__x <= 27 RESULT: Ultimate proved your program to be correct! [2021-08-29 11:01:34,929 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...