./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD --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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:02:24,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:02:24,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:02:24,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:02:24,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:02:24,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:02:24,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:02:24,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:02:24,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:02:24,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:02:24,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:02:24,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:02:24,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:02:24,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:02:24,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:02:24,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:02:24,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:02:24,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:02:24,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:02:24,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:02:24,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:02:24,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:02:24,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:02:24,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:02:24,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:02:24,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:02:24,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:02:24,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:02:24,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:02:24,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:02:24,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:02:24,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:02:24,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:02:24,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:02:24,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:02:24,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:02:24,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:02:24,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:02:24,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:02:24,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:02:24,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:02:24,495 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 23:02:24,544 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:02:24,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:02:24,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:02:24,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:02:24,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:02:24,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:02:24,551 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:02:24,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:02:24,551 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:02:24,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:02:24,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:02:24,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:02:24,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 23:02:24,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:02:24,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 23:02:24,554 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:02:24,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:02:24,554 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:02:24,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 23:02:24,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:02:24,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:02:24,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:02:24,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:02:24,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:02:24,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:02:24,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 23:02:24,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:02:24,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:02:24,557 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 23:02:24,558 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 23:02:24,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 23:02:24,558 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:02:24,559 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2021-10-28 23:02:24,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:02:24,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:02:24,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:02:24,930 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:02:24,931 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:02:24,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/locks/test_locks_8.c [2021-10-28 23:02:25,019 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/data/3f844cbd0/74502228a3a249bbbded7467af0a8fe2/FLAG47d6341aa [2021-10-28 23:02:25,530 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:02:25,535 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/sv-benchmarks/c/locks/test_locks_8.c [2021-10-28 23:02:25,543 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/data/3f844cbd0/74502228a3a249bbbded7467af0a8fe2/FLAG47d6341aa [2021-10-28 23:02:25,910 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/data/3f844cbd0/74502228a3a249bbbded7467af0a8fe2 [2021-10-28 23:02:25,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:02:25,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:02:25,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:02:25,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:02:25,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:02:25,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:02:25" (1/1) ... [2021-10-28 23:02:25,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32877f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:25, skipping insertion in model container [2021-10-28 23:02:25,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:02:25" (1/1) ... [2021-10-28 23:02:25,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:02:25,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:02:26,154 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-10-28 23:02:26,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:02:26,172 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:02:26,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-10-28 23:02:26,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:02:26,239 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:02:26,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26 WrapperNode [2021-10-28 23:02:26,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:02:26,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:02:26,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:02:26,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:02:26,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:02:26,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:02:26,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:02:26,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:02:26,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:02:26,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:02:26,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:02:26,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:02:26,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (1/1) ... [2021-10-28 23:02:26,365 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:02:26,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:02:26,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:02:26,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:02:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:02:26,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:02:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:02:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:02:26,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:02:26,838 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-28 23:02:26,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:02:26 BoogieIcfgContainer [2021-10-28 23:02:26,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:02:26,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:02:26,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:02:26,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:02:26,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:02:25" (1/3) ... [2021-10-28 23:02:26,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb12362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:02:26, skipping insertion in model container [2021-10-28 23:02:26,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:02:26" (2/3) ... [2021-10-28 23:02:26,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb12362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:02:26, skipping insertion in model container [2021-10-28 23:02:26,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:02:26" (3/3) ... [2021-10-28 23:02:26,862 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2021-10-28 23:02:26,868 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:02:26,868 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 23:02:26,954 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:02:26,968 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 23:02:26,969 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 23:02:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 23:02:26,994 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:26,995 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:26,997 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1577492323, now seen corresponding path program 1 times [2021-10-28 23:02:27,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:27,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605850211] [2021-10-28 23:02:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:27,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:27,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:27,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605850211] [2021-10-28 23:02:27,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605850211] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:27,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:27,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:27,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778962870] [2021-10-28 23:02:27,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:27,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:27,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:27,358 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:27,422 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. [2021-10-28 23:02:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:27,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-28 23:02:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:27,437 INFO L225 Difference]: With dead ends: 71 [2021-10-28 23:02:27,437 INFO L226 Difference]: Without dead ends: 57 [2021-10-28 23:02:27,440 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-10-28 23:02:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2021-10-28 23:02:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2021-10-28 23:02:27,491 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2021-10-28 23:02:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:27,492 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2021-10-28 23:02:27,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2021-10-28 23:02:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 23:02:27,494 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:27,495 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:27,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:02:27,495 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash -876427745, now seen corresponding path program 1 times [2021-10-28 23:02:27,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:27,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444679630] [2021-10-28 23:02:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:27,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:27,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:27,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444679630] [2021-10-28 23:02:27,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444679630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:27,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:27,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:27,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609738393] [2021-10-28 23:02:27,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:27,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:27,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:27,624 INFO L87 Difference]: Start difference. First operand 39 states and 70 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:27,656 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2021-10-28 23:02:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-28 23:02:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:27,662 INFO L225 Difference]: With dead ends: 94 [2021-10-28 23:02:27,662 INFO L226 Difference]: Without dead ends: 57 [2021-10-28 23:02:27,663 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-10-28 23:02:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2021-10-28 23:02:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2021-10-28 23:02:27,703 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2021-10-28 23:02:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:27,704 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2021-10-28 23:02:27,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2021-10-28 23:02:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 23:02:27,706 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:27,707 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:27,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 23:02:27,709 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1657407761, now seen corresponding path program 1 times [2021-10-28 23:02:27,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:27,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758921348] [2021-10-28 23:02:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:27,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:27,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:27,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758921348] [2021-10-28 23:02:27,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758921348] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:27,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:27,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:27,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113614072] [2021-10-28 23:02:27,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:27,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:27,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:27,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:27,802 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:27,832 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2021-10-28 23:02:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:27,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-10-28 23:02:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:27,837 INFO L225 Difference]: With dead ends: 87 [2021-10-28 23:02:27,838 INFO L226 Difference]: Without dead ends: 60 [2021-10-28 23:02:27,838 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-10-28 23:02:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2021-10-28 23:02:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2021-10-28 23:02:27,854 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2021-10-28 23:02:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:27,855 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2021-10-28 23:02:27,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2021-10-28 23:02:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 23:02:27,857 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:27,857 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:27,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 23:02:27,858 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1399242323, now seen corresponding path program 1 times [2021-10-28 23:02:27,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:27,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448969623] [2021-10-28 23:02:27,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:27,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:27,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:27,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448969623] [2021-10-28 23:02:27,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448969623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:27,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:27,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:27,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021624862] [2021-10-28 23:02:27,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:27,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:27,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:27,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:27,939 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:27,969 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2021-10-28 23:02:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-10-28 23:02:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:27,974 INFO L225 Difference]: With dead ends: 109 [2021-10-28 23:02:27,974 INFO L226 Difference]: Without dead ends: 107 [2021-10-28 23:02:27,976 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-10-28 23:02:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2021-10-28 23:02:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2021-10-28 23:02:27,997 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 16 [2021-10-28 23:02:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:27,998 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2021-10-28 23:02:27,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2021-10-28 23:02:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 23:02:28,001 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,001 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:28,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 23:02:28,002 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash -698177745, now seen corresponding path program 1 times [2021-10-28 23:02:28,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501937501] [2021-10-28 23:02:28,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501937501] [2021-10-28 23:02:28,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501937501] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966959354] [2021-10-28 23:02:28,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,080 INFO L87 Difference]: Start difference. First operand 77 states and 133 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,095 INFO L93 Difference]: Finished difference Result 181 states and 315 transitions. [2021-10-28 23:02:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-10-28 23:02:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,097 INFO L225 Difference]: With dead ends: 181 [2021-10-28 23:02:28,097 INFO L226 Difference]: Without dead ends: 109 [2021-10-28 23:02:28,098 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-28 23:02:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2021-10-28 23:02:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2021-10-28 23:02:28,115 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2021-10-28 23:02:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,115 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2021-10-28 23:02:28,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2021-10-28 23:02:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 23:02:28,118 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,118 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:28,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 23:02:28,119 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash -426624716, now seen corresponding path program 1 times [2021-10-28 23:02:28,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519510114] [2021-10-28 23:02:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519510114] [2021-10-28 23:02:28,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519510114] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597755767] [2021-10-28 23:02:28,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,176 INFO L87 Difference]: Start difference. First operand 107 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,188 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2021-10-28 23:02:28,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-28 23:02:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,190 INFO L225 Difference]: With dead ends: 162 [2021-10-28 23:02:28,190 INFO L226 Difference]: Without dead ends: 111 [2021-10-28 23:02:28,191 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-10-28 23:02:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-10-28 23:02:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 183 transitions. [2021-10-28 23:02:28,199 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 183 transitions. Word has length 17 [2021-10-28 23:02:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,199 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 183 transitions. [2021-10-28 23:02:28,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 183 transitions. [2021-10-28 23:02:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 23:02:28,201 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,201 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:28,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 23:02:28,201 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,202 INFO L85 PathProgramCache]: Analyzing trace with hash -168459278, now seen corresponding path program 1 times [2021-10-28 23:02:28,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65167010] [2021-10-28 23:02:28,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65167010] [2021-10-28 23:02:28,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65167010] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384013792] [2021-10-28 23:02:28,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,277 INFO L87 Difference]: Start difference. First operand 109 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,295 INFO L93 Difference]: Finished difference Result 309 states and 521 transitions. [2021-10-28 23:02:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-28 23:02:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,297 INFO L225 Difference]: With dead ends: 309 [2021-10-28 23:02:28,297 INFO L226 Difference]: Without dead ends: 207 [2021-10-28 23:02:28,298 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-10-28 23:02:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2021-10-28 23:02:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 339 transitions. [2021-10-28 23:02:28,319 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 339 transitions. Word has length 17 [2021-10-28 23:02:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,320 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 339 transitions. [2021-10-28 23:02:28,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2021-10-28 23:02:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 23:02:28,324 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,324 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:28,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 23:02:28,324 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash -869523856, now seen corresponding path program 1 times [2021-10-28 23:02:28,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156905022] [2021-10-28 23:02:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156905022] [2021-10-28 23:02:28,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156905022] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987106887] [2021-10-28 23:02:28,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,359 INFO L87 Difference]: Start difference. First operand 205 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,374 INFO L93 Difference]: Finished difference Result 257 states and 429 transitions. [2021-10-28 23:02:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-28 23:02:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,376 INFO L225 Difference]: With dead ends: 257 [2021-10-28 23:02:28,376 INFO L226 Difference]: Without dead ends: 255 [2021-10-28 23:02:28,377 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-28 23:02:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2021-10-28 23:02:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2021-10-28 23:02:28,387 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 17 [2021-10-28 23:02:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,388 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2021-10-28 23:02:28,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2021-10-28 23:02:28,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 23:02:28,402 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,402 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:28,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 23:02:28,402 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash -927055644, now seen corresponding path program 1 times [2021-10-28 23:02:28,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99351767] [2021-10-28 23:02:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99351767] [2021-10-28 23:02:28,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99351767] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266653733] [2021-10-28 23:02:28,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,441 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,458 INFO L93 Difference]: Finished difference Result 373 states and 617 transitions. [2021-10-28 23:02:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-28 23:02:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,461 INFO L225 Difference]: With dead ends: 373 [2021-10-28 23:02:28,461 INFO L226 Difference]: Without dead ends: 371 [2021-10-28 23:02:28,462 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-10-28 23:02:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 289. [2021-10-28 23:02:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 463 transitions. [2021-10-28 23:02:28,498 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 463 transitions. Word has length 18 [2021-10-28 23:02:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,498 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 463 transitions. [2021-10-28 23:02:28,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 463 transitions. [2021-10-28 23:02:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 23:02:28,501 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,501 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:28,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 23:02:28,501 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,502 INFO L85 PathProgramCache]: Analyzing trace with hash -225991066, now seen corresponding path program 1 times [2021-10-28 23:02:28,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445460750] [2021-10-28 23:02:28,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445460750] [2021-10-28 23:02:28,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445460750] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109487048] [2021-10-28 23:02:28,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,533 INFO L87 Difference]: Start difference. First operand 289 states and 463 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,554 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2021-10-28 23:02:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-28 23:02:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,557 INFO L225 Difference]: With dead ends: 677 [2021-10-28 23:02:28,557 INFO L226 Difference]: Without dead ends: 395 [2021-10-28 23:02:28,558 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-10-28 23:02:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2021-10-28 23:02:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 619 transitions. [2021-10-28 23:02:28,575 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 619 transitions. Word has length 18 [2021-10-28 23:02:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,576 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 619 transitions. [2021-10-28 23:02:28,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 619 transitions. [2021-10-28 23:02:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 23:02:28,577 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,577 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:28,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 23:02:28,578 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1326261127, now seen corresponding path program 1 times [2021-10-28 23:02:28,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213413267] [2021-10-28 23:02:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213413267] [2021-10-28 23:02:28,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213413267] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916825201] [2021-10-28 23:02:28,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,635 INFO L87 Difference]: Start difference. First operand 393 states and 619 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,667 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2021-10-28 23:02:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-28 23:02:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,671 INFO L225 Difference]: With dead ends: 597 [2021-10-28 23:02:28,671 INFO L226 Difference]: Without dead ends: 407 [2021-10-28 23:02:28,672 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-10-28 23:02:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2021-10-28 23:02:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2021-10-28 23:02:28,688 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2021-10-28 23:02:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,689 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2021-10-28 23:02:28,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2021-10-28 23:02:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 23:02:28,691 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,691 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:28,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 23:02:28,691 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1584426565, now seen corresponding path program 1 times [2021-10-28 23:02:28,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136909746] [2021-10-28 23:02:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136909746] [2021-10-28 23:02:28,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136909746] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767980767] [2021-10-28 23:02:28,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,721 INFO L87 Difference]: Start difference. First operand 405 states and 627 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,742 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2021-10-28 23:02:28,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-28 23:02:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,747 INFO L225 Difference]: With dead ends: 713 [2021-10-28 23:02:28,748 INFO L226 Difference]: Without dead ends: 711 [2021-10-28 23:02:28,748 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-10-28 23:02:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2021-10-28 23:02:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2021-10-28 23:02:28,791 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2021-10-28 23:02:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,791 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2021-10-28 23:02:28,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2021-10-28 23:02:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 23:02:28,794 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,794 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:28,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 23:02:28,795 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2009476153, now seen corresponding path program 1 times [2021-10-28 23:02:28,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277432065] [2021-10-28 23:02:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277432065] [2021-10-28 23:02:28,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277432065] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892710105] [2021-10-28 23:02:28,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,826 INFO L87 Difference]: Start difference. First operand 581 states and 875 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,854 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2021-10-28 23:02:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-28 23:02:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,860 INFO L225 Difference]: With dead ends: 1337 [2021-10-28 23:02:28,861 INFO L226 Difference]: Without dead ends: 775 [2021-10-28 23:02:28,862 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-10-28 23:02:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2021-10-28 23:02:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2021-10-28 23:02:28,896 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2021-10-28 23:02:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,896 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2021-10-28 23:02:28,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2021-10-28 23:02:28,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 23:02:28,899 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,899 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] [2021-10-28 23:02:28,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 23:02:28,899 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1872798619, now seen corresponding path program 1 times [2021-10-28 23:02:28,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237200790] [2021-10-28 23:02:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:28,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:28,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237200790] [2021-10-28 23:02:28,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237200790] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:28,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:28,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:28,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822086961] [2021-10-28 23:02:28,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:28,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:28,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:28,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,930 INFO L87 Difference]: Start difference. First operand 773 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:28,952 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2021-10-28 23:02:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-28 23:02:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:28,958 INFO L225 Difference]: With dead ends: 1161 [2021-10-28 23:02:28,958 INFO L226 Difference]: Without dead ends: 791 [2021-10-28 23:02:28,959 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-10-28 23:02:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2021-10-28 23:02:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2021-10-28 23:02:28,989 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2021-10-28 23:02:28,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:28,989 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2021-10-28 23:02:28,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2021-10-28 23:02:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 23:02:28,991 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:28,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] [2021-10-28 23:02:28,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 23:02:28,992 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2130964057, now seen corresponding path program 1 times [2021-10-28 23:02:28,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:28,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853302124] [2021-10-28 23:02:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:28,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:29,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:29,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853302124] [2021-10-28 23:02:29,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853302124] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:29,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:29,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:29,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106178935] [2021-10-28 23:02:29,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:29,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,019 INFO L87 Difference]: Start difference. First operand 789 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:29,048 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2021-10-28 23:02:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:29,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-28 23:02:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:29,057 INFO L225 Difference]: With dead ends: 1353 [2021-10-28 23:02:29,057 INFO L226 Difference]: Without dead ends: 1351 [2021-10-28 23:02:29,058 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-10-28 23:02:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2021-10-28 23:02:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2021-10-28 23:02:29,123 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2021-10-28 23:02:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:29,123 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2021-10-28 23:02:29,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2021-10-28 23:02:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 23:02:29,126 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:29,126 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] [2021-10-28 23:02:29,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 23:02:29,127 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1462938661, now seen corresponding path program 1 times [2021-10-28 23:02:29,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:29,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876734344] [2021-10-28 23:02:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:29,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:29,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:29,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876734344] [2021-10-28 23:02:29,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876734344] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:29,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:29,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:29,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945708307] [2021-10-28 23:02:29,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:29,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:29,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:29,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,153 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:29,190 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2021-10-28 23:02:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-28 23:02:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:29,200 INFO L225 Difference]: With dead ends: 2633 [2021-10-28 23:02:29,200 INFO L226 Difference]: Without dead ends: 1511 [2021-10-28 23:02:29,202 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2021-10-28 23:02:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2021-10-28 23:02:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2021-10-28 23:02:29,263 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2021-10-28 23:02:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:29,264 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2021-10-28 23:02:29,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2021-10-28 23:02:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 23:02:29,266 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:29,267 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] [2021-10-28 23:02:29,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 23:02:29,267 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1635592028, now seen corresponding path program 1 times [2021-10-28 23:02:29,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:29,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308574564] [2021-10-28 23:02:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:29,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:29,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:29,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308574564] [2021-10-28 23:02:29,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308574564] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:29,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:29,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:29,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822009621] [2021-10-28 23:02:29,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:29,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:29,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,292 INFO L87 Difference]: Start difference. First operand 1509 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:29,326 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2021-10-28 23:02:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-10-28 23:02:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:29,335 INFO L225 Difference]: With dead ends: 2265 [2021-10-28 23:02:29,335 INFO L226 Difference]: Without dead ends: 1543 [2021-10-28 23:02:29,337 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2021-10-28 23:02:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2021-10-28 23:02:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2021-10-28 23:02:29,392 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2021-10-28 23:02:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:29,392 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2021-10-28 23:02:29,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2021-10-28 23:02:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 23:02:29,395 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:29,395 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] [2021-10-28 23:02:29,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 23:02:29,395 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:29,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1893757466, now seen corresponding path program 1 times [2021-10-28 23:02:29,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:29,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787153207] [2021-10-28 23:02:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:29,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:29,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:29,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787153207] [2021-10-28 23:02:29,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787153207] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:29,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:29,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:29,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912865136] [2021-10-28 23:02:29,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:29,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:29,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:29,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,425 INFO L87 Difference]: Start difference. First operand 1541 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:29,473 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2021-10-28 23:02:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-10-28 23:02:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:29,487 INFO L225 Difference]: With dead ends: 2569 [2021-10-28 23:02:29,487 INFO L226 Difference]: Without dead ends: 2567 [2021-10-28 23:02:29,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2021-10-28 23:02:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2021-10-28 23:02:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2021-10-28 23:02:29,567 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2021-10-28 23:02:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:29,567 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2021-10-28 23:02:29,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2021-10-28 23:02:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 23:02:29,571 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:29,572 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] [2021-10-28 23:02:29,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 23:02:29,572 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:29,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1700145252, now seen corresponding path program 1 times [2021-10-28 23:02:29,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:29,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932366212] [2021-10-28 23:02:29,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:29,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:29,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:29,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932366212] [2021-10-28 23:02:29,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932366212] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:29,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:29,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:29,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036199816] [2021-10-28 23:02:29,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:29,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,595 INFO L87 Difference]: Start difference. First operand 2309 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:29,662 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2021-10-28 23:02:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:29,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-10-28 23:02:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:29,678 INFO L225 Difference]: With dead ends: 5193 [2021-10-28 23:02:29,679 INFO L226 Difference]: Without dead ends: 2951 [2021-10-28 23:02:29,682 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-10-28 23:02:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2021-10-28 23:02:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2021-10-28 23:02:29,803 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2021-10-28 23:02:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:29,803 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2021-10-28 23:02:29,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2021-10-28 23:02:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 23:02:29,808 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:29,808 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] [2021-10-28 23:02:29,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 23:02:29,808 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1422844656, now seen corresponding path program 1 times [2021-10-28 23:02:29,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:29,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679266197] [2021-10-28 23:02:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:29,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:29,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:29,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679266197] [2021-10-28 23:02:29,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679266197] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:29,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:29,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:29,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665435210] [2021-10-28 23:02:29,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:29,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:29,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:29,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,833 INFO L87 Difference]: Start difference. First operand 2949 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:29,893 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2021-10-28 23:02:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-28 23:02:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:29,909 INFO L225 Difference]: With dead ends: 4425 [2021-10-28 23:02:29,910 INFO L226 Difference]: Without dead ends: 3015 [2021-10-28 23:02:29,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2021-10-28 23:02:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2021-10-28 23:02:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2021-10-28 23:02:30,058 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2021-10-28 23:02:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:30,058 INFO L470 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2021-10-28 23:02:30,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2021-10-28 23:02:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 23:02:30,064 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:30,064 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] [2021-10-28 23:02:30,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 23:02:30,065 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1164679218, now seen corresponding path program 1 times [2021-10-28 23:02:30,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:30,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906040802] [2021-10-28 23:02:30,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:30,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:30,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:30,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906040802] [2021-10-28 23:02:30,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906040802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:30,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:30,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:30,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983676576] [2021-10-28 23:02:30,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:30,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:30,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:30,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:30,091 INFO L87 Difference]: Start difference. First operand 3013 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:30,193 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2021-10-28 23:02:30,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-28 23:02:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:30,219 INFO L225 Difference]: With dead ends: 4871 [2021-10-28 23:02:30,219 INFO L226 Difference]: Without dead ends: 4869 [2021-10-28 23:02:30,221 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2021-10-28 23:02:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2021-10-28 23:02:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2021-10-28 23:02:30,417 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2021-10-28 23:02:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:30,417 INFO L470 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2021-10-28 23:02:30,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2021-10-28 23:02:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 23:02:30,425 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:02:30,425 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] [2021-10-28 23:02:30,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 23:02:30,426 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:02:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:02:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -463614640, now seen corresponding path program 1 times [2021-10-28 23:02:30,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:02:30,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272635648] [2021-10-28 23:02:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:02:30,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:02:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:02:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:02:30,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:02:30,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272635648] [2021-10-28 23:02:30,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272635648] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:02:30,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:02:30,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:02:30,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769737294] [2021-10-28 23:02:30,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:02:30,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:02:30,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:02:30,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:30,449 INFO L87 Difference]: Start difference. First operand 4613 states and 5443 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:30,574 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2021-10-28 23:02:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:02:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-28 23:02:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:30,575 INFO L225 Difference]: With dead ends: 10245 [2021-10-28 23:02:30,575 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 23:02:30,585 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:02:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 23:02:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 23:02:30,586 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-10-28 23:02:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 23:02:30,586 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-10-28 23:02:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:30,586 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 23:02:30,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 23:02:30,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 23:02:30,590 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:02:30,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 23:02:30,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 23:02:30,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:30,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:30,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:30,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:30,607 INFO L857 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2021-10-28 23:02:30,607 INFO L857 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2021-10-28 23:02:30,608 INFO L857 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,608 INFO L860 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2021-10-28 23:02:30,608 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 23:02:30,608 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 23:02:30,608 INFO L857 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,608 INFO L857 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,609 INFO L860 garLoopResultBuilder]: At program point L136(lines 6 137) the Hoare annotation is: true [2021-10-28 23:02:30,609 INFO L857 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2021-10-28 23:02:30,609 INFO L857 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2021-10-28 23:02:30,609 INFO L857 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,609 INFO L857 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2021-10-28 23:02:30,610 INFO L853 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2021-10-28 23:02:30,610 INFO L857 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,610 INFO L857 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,610 INFO L857 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2021-10-28 23:02:30,610 INFO L857 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,611 INFO L857 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,611 INFO L857 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2021-10-28 23:02:30,611 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 23:02:30,611 INFO L857 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2021-10-28 23:02:30,611 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2021-10-28 23:02:30,612 INFO L857 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,612 INFO L857 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,612 INFO L857 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,612 INFO L857 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,612 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 23:02:30,612 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2021-10-28 23:02:30,613 INFO L857 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,613 INFO L857 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2021-10-28 23:02:30,613 INFO L860 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2021-10-28 23:02:30,613 INFO L857 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,613 INFO L857 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 23:02:30,617 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:30,619 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:02:30,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:02:30 BoogieIcfgContainer [2021-10-28 23:02:30,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:02:30,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:02:30,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:02:30,628 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:02:30,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:02:26" (3/4) ... [2021-10-28 23:02:30,632 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 23:02:30,644 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 23:02:30,644 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 23:02:30,645 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:02:30,645 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:02:30,690 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:02:30,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:02:30,692 INFO L168 Benchmark]: Toolchain (without parser) took 4776.31 ms. Allocated memory was 109.1 MB in the beginning and 165.7 MB in the end (delta: 56.6 MB). Free memory was 77.1 MB in the beginning and 76.4 MB in the end (delta: 642.0 kB). Peak memory consumption was 56.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:30,693 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 81.8 MB. Free memory was 51.9 MB in the beginning and 51.9 MB in the end (delta: 22.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:02:30,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.21 ms. Allocated memory is still 109.1 MB. Free memory was 77.1 MB in the beginning and 84.8 MB in the end (delta: -7.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:30,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.28 ms. Allocated memory is still 109.1 MB. Free memory was 84.8 MB in the beginning and 83.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:30,694 INFO L168 Benchmark]: Boogie Preprocessor took 49.11 ms. Allocated memory is still 109.1 MB. Free memory was 83.1 MB in the beginning and 82.1 MB in the end (delta: 977.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:30,694 INFO L168 Benchmark]: RCFGBuilder took 488.43 ms. Allocated memory is still 109.1 MB. Free memory was 81.6 MB in the beginning and 70.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:30,695 INFO L168 Benchmark]: TraceAbstraction took 3785.16 ms. Allocated memory was 109.1 MB in the beginning and 165.7 MB in the end (delta: 56.6 MB). Free memory was 69.5 MB in the beginning and 80.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:30,696 INFO L168 Benchmark]: Witness Printer took 62.85 ms. Allocated memory is still 165.7 MB. Free memory was 79.6 MB in the beginning and 76.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:30,698 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 81.8 MB. Free memory was 51.9 MB in the beginning and 51.9 MB in the end (delta: 22.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 323.21 ms. Allocated memory is still 109.1 MB. Free memory was 77.1 MB in the beginning and 84.8 MB in the end (delta: -7.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.28 ms. Allocated memory is still 109.1 MB. Free memory was 84.8 MB in the beginning and 83.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.11 ms. Allocated memory is still 109.1 MB. Free memory was 83.1 MB in the beginning and 82.1 MB in the end (delta: 977.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 488.43 ms. Allocated memory is still 109.1 MB. Free memory was 81.6 MB in the beginning and 70.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3785.16 ms. Allocated memory was 109.1 MB in the beginning and 165.7 MB in the end (delta: 56.6 MB). Free memory was 69.5 MB in the beginning and 80.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. * Witness Printer took 62.85 ms. Allocated memory is still 165.7 MB. Free memory was 79.6 MB in the beginning and 76.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1474 SDtfs, 720 SDslu, 964 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-10-28 23:02:30,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73a26b9b-02af-4a9d-9d50-0d6c1b9b7c10/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...