./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:20:51,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:20:51,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:20:51,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:20:51,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:20:51,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:20:51,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:20:51,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:20:51,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:20:51,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:20:51,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:20:51,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:20:51,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:20:51,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:20:51,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:20:51,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:20:51,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:20:51,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:20:51,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:20:51,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:20:51,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:20:51,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:20:51,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:20:51,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:20:51,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:20:51,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:20:51,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:20:51,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:20:51,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:20:51,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:20:51,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:20:51,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:20:51,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:20:51,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:20:51,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:20:51,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:20:51,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:20:51,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:20:51,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:20:51,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:20:51,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:20:51,206 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 22:20:51,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:20:51,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:20:51,237 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:20:51,238 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:20:51,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:20:51,239 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:20:51,239 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:20:51,239 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:20:51,240 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:20:51,240 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:20:51,241 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:20:51,241 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:20:51,242 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:20:51,242 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:20:51,242 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:20:51,242 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:20:51,243 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:20:51,243 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:20:51,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:20:51,244 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:20:51,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:20:51,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:20:51,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:20:51,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:20:51,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:20:51,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:20:51,246 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:20:51,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:20:51,247 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:20:51,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:20:51,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:20:51,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:20:51,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:20:51,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:20:51,249 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:20:51,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:20:51,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:20:51,250 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:20:51,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:20:51,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:20:51,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:20:51,251 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_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/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_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur 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 -> Taipan 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-11-25 22:20:51,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:20:51,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:20:51,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:20:51,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:20:51,607 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:20:51,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/locks/test_locks_13.c [2022-11-25 22:20:54,846 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:20:55,112 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:20:55,113 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/sv-benchmarks/c/locks/test_locks_13.c [2022-11-25 22:20:55,126 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/data/a47280a00/6d071e3773eb4af5a1f061ef5d76637c/FLAG2a94c29db [2022-11-25 22:20:55,147 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/data/a47280a00/6d071e3773eb4af5a1f061ef5d76637c [2022-11-25 22:20:55,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:20:55,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:20:55,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:20:55,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:20:55,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:20:55,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32bbf311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55, skipping insertion in model container [2022-11-25 22:20:55,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:20:55,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:20:55,387 WARN L237 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_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-11-25 22:20:55,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:20:55,402 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:20:55,434 WARN L237 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_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-11-25 22:20:55,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:20:55,468 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:20:55,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55 WrapperNode [2022-11-25 22:20:55,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:20:55,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:20:55,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:20:55,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:20:55,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,538 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 171 [2022-11-25 22:20:55,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:20:55,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:20:55,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:20:55,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:20:55,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,571 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:20:55,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:20:55,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:20:55,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:20:55,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (1/1) ... [2022-11-25 22:20:55,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:20:55,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:20:55,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:20:55,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:20:55,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:20:55,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:20:55,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:20:55,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:20:55,789 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:20:55,792 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:20:56,095 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:20:56,304 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:20:56,304 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 22:20:56,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:20:56 BoogieIcfgContainer [2022-11-25 22:20:56,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:20:56,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:20:56,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:20:56,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:20:56,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:20:55" (1/3) ... [2022-11-25 22:20:56,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6187bd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:20:56, skipping insertion in model container [2022-11-25 22:20:56,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:20:55" (2/3) ... [2022-11-25 22:20:56,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6187bd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:20:56, skipping insertion in model container [2022-11-25 22:20:56,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:20:56" (3/3) ... [2022-11-25 22:20:56,324 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-11-25 22:20:56,347 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:20:56,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 22:20:56,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:20:56,404 INFO L357 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@af0dbd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:20:56,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 22:20:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.90625) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 22:20:56,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:56,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 22:20:56,416 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash -583923856, now seen corresponding path program 1 times [2022-11-25 22:20:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:56,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621695899] [2022-11-25 22:20:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:56,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:56,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621695899] [2022-11-25 22:20:56,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621695899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:56,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:56,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057141561] [2022-11-25 22:20:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:56,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:56,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:56,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:56,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:56,858 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.90625) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:56,967 INFO L93 Difference]: Finished difference Result 70 states and 121 transitions. [2022-11-25 22:20:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-25 22:20:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:56,980 INFO L225 Difference]: With dead ends: 70 [2022-11-25 22:20:56,980 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 22:20:56,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:56,987 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 54 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:56,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 162 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:20:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 22:20:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2022-11-25 22:20:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 55 transitions. [2022-11-25 22:20:57,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 55 transitions. Word has length 6 [2022-11-25 22:20:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:57,031 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 55 transitions. [2022-11-25 22:20:57,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2022-11-25 22:20:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:20:57,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:57,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:57,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:20:57,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash -921557976, now seen corresponding path program 1 times [2022-11-25 22:20:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:57,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964364322] [2022-11-25 22:20:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:57,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:57,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:57,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964364322] [2022-11-25 22:20:57,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964364322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:57,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:57,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:57,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411878527] [2022-11-25 22:20:57,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:57,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:57,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:57,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:57,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,134 INFO L87 Difference]: Start difference. First operand 31 states and 55 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:57,159 INFO L93 Difference]: Finished difference Result 59 states and 103 transitions. [2022-11-25 22:20:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:57,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-25 22:20:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:57,161 INFO L225 Difference]: With dead ends: 59 [2022-11-25 22:20:57,161 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 22:20:57,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,163 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 49 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:57,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 22:20:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2022-11-25 22:20:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2022-11-25 22:20:57,170 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 7 [2022-11-25 22:20:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:57,170 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2022-11-25 22:20:57,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2022-11-25 22:20:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:20:57,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:57,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:57,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:20:57,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:57,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1496686533, now seen corresponding path program 1 times [2022-11-25 22:20:57,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:57,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667189053] [2022-11-25 22:20:57,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:57,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:57,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667189053] [2022-11-25 22:20:57,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667189053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:57,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:57,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880664722] [2022-11-25 22:20:57,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:57,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,292 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:57,331 INFO L93 Difference]: Finished difference Result 57 states and 98 transitions. [2022-11-25 22:20:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:57,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 22:20:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:57,339 INFO L225 Difference]: With dead ends: 57 [2022-11-25 22:20:57,339 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 22:20:57,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,340 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 47 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:57,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 140 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 22:20:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2022-11-25 22:20:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 53 transitions. [2022-11-25 22:20:57,351 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 53 transitions. Word has length 8 [2022-11-25 22:20:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:57,351 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 53 transitions. [2022-11-25 22:20:57,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 53 transitions. [2022-11-25 22:20:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:20:57,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:57,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:57,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 22:20:57,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:57,355 INFO L85 PathProgramCache]: Analyzing trace with hash -847144675, now seen corresponding path program 1 times [2022-11-25 22:20:57,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:57,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390663955] [2022-11-25 22:20:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:57,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:57,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:57,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390663955] [2022-11-25 22:20:57,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390663955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:57,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:57,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:57,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563969171] [2022-11-25 22:20:57,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:57,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:57,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:57,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:57,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,479 INFO L87 Difference]: Start difference. First operand 31 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:57,514 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-11-25 22:20:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:57,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-25 22:20:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:57,516 INFO L225 Difference]: With dead ends: 55 [2022-11-25 22:20:57,519 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 22:20:57,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,521 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 45 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:57,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 133 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 22:20:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2022-11-25 22:20:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 52 transitions. [2022-11-25 22:20:57,536 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 52 transitions. Word has length 9 [2022-11-25 22:20:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:57,537 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 52 transitions. [2022-11-25 22:20:57,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 52 transitions. [2022-11-25 22:20:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 22:20:57,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:57,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:57,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 22:20:57,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash -491467750, now seen corresponding path program 1 times [2022-11-25 22:20:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:57,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057874975] [2022-11-25 22:20:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:57,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:57,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:57,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057874975] [2022-11-25 22:20:57,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057874975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:57,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:57,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257237133] [2022-11-25 22:20:57,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:57,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,627 INFO L87 Difference]: Start difference. First operand 31 states and 52 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:57,649 INFO L93 Difference]: Finished difference Result 53 states and 88 transitions. [2022-11-25 22:20:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:57,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 22:20:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:57,651 INFO L225 Difference]: With dead ends: 53 [2022-11-25 22:20:57,651 INFO L226 Difference]: Without dead ends: 51 [2022-11-25 22:20:57,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,653 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 43 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:57,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 128 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-25 22:20:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2022-11-25 22:20:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2022-11-25 22:20:57,658 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 10 [2022-11-25 22:20:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:57,659 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2022-11-25 22:20:57,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2022-11-25 22:20:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:20:57,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:57,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:57,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:20:57,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1944582674, now seen corresponding path program 1 times [2022-11-25 22:20:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:57,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845772135] [2022-11-25 22:20:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:57,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:57,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845772135] [2022-11-25 22:20:57,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845772135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:57,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:57,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:57,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334481972] [2022-11-25 22:20:57,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:57,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:57,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:57,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:57,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,722 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:57,752 INFO L93 Difference]: Finished difference Result 51 states and 83 transitions. [2022-11-25 22:20:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:57,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 22:20:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:57,754 INFO L225 Difference]: With dead ends: 51 [2022-11-25 22:20:57,756 INFO L226 Difference]: Without dead ends: 49 [2022-11-25 22:20:57,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,758 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:57,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 121 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-25 22:20:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-11-25 22:20:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-11-25 22:20:57,774 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 11 [2022-11-25 22:20:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:57,774 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-11-25 22:20:57,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-11-25 22:20:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 22:20:57,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:57,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:57,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 22:20:57,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash 152734831, now seen corresponding path program 1 times [2022-11-25 22:20:57,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:57,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895099940] [2022-11-25 22:20:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:57,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:57,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:57,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895099940] [2022-11-25 22:20:57,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895099940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:57,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:57,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:57,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605291166] [2022-11-25 22:20:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:57,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:57,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:57,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:57,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,898 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:57,943 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2022-11-25 22:20:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:57,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 22:20:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:57,945 INFO L225 Difference]: With dead ends: 49 [2022-11-25 22:20:57,945 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 22:20:57,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:57,946 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:57,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 22:20:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-11-25 22:20:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2022-11-25 22:20:57,951 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 12 [2022-11-25 22:20:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:57,951 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2022-11-25 22:20:57,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2022-11-25 22:20:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:20:57,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:57,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:57,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 22:20:57,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:57,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:57,955 INFO L85 PathProgramCache]: Analyzing trace with hash 440026887, now seen corresponding path program 1 times [2022-11-25 22:20:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:57,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443886935] [2022-11-25 22:20:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:57,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:58,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:58,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443886935] [2022-11-25 22:20:58,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443886935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:58,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:58,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086018378] [2022-11-25 22:20:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:58,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:58,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:58,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,016 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:58,036 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2022-11-25 22:20:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:58,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 22:20:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:58,038 INFO L225 Difference]: With dead ends: 47 [2022-11-25 22:20:58,038 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 22:20:58,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,040 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:58,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 110 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 22:20:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-11-25 22:20:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2022-11-25 22:20:58,045 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2022-11-25 22:20:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:58,045 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-25 22:20:58,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2022-11-25 22:20:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 22:20:58,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:58,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:58,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 22:20:58,047 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash 756146372, now seen corresponding path program 1 times [2022-11-25 22:20:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:58,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741663498] [2022-11-25 22:20:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:58,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:58,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:58,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741663498] [2022-11-25 22:20:58,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741663498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:58,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:58,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:58,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695509976] [2022-11-25 22:20:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:58,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:58,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:58,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:58,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,108 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:58,129 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-11-25 22:20:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:58,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-25 22:20:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:58,130 INFO L225 Difference]: With dead ends: 45 [2022-11-25 22:20:58,130 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 22:20:58,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,132 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 35 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:58,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 22:20:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-11-25 22:20:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2022-11-25 22:20:58,136 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 14 [2022-11-25 22:20:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:58,137 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2022-11-25 22:20:58,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2022-11-25 22:20:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 22:20:58,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:58,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:58,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 22:20:58,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:58,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1965916156, now seen corresponding path program 1 times [2022-11-25 22:20:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:58,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356599104] [2022-11-25 22:20:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:58,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:58,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356599104] [2022-11-25 22:20:58,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356599104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:58,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:58,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:58,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510466736] [2022-11-25 22:20:58,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:58,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:58,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:58,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,198 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2022-11-25 22:20:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:58,215 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2022-11-25 22:20:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:58,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 [2022-11-25 22:20:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:58,216 INFO L225 Difference]: With dead ends: 43 [2022-11-25 22:20:58,216 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 22:20:58,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,218 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:58,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 97 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 22:20:58,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-11-25 22:20:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2022-11-25 22:20:58,222 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 15 [2022-11-25 22:20:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:58,222 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2022-11-25 22:20:58,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2022-11-25 22:20:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2022-11-25 22:20:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:20:58,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:58,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:58,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 22:20:58,226 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:58,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:58,227 INFO L85 PathProgramCache]: Analyzing trace with hash 814074137, now seen corresponding path program 1 times [2022-11-25 22:20:58,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:58,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35335514] [2022-11-25 22:20:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:58,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:58,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35335514] [2022-11-25 22:20:58,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35335514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:58,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:58,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031266080] [2022-11-25 22:20:58,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:58,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:58,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:58,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,296 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2022-11-25 22:20:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:58,317 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2022-11-25 22:20:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:58,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 [2022-11-25 22:20:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:58,324 INFO L225 Difference]: With dead ends: 41 [2022-11-25 22:20:58,324 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 22:20:58,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,327 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:58,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:58,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 22:20:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-11-25 22:20:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-11-25 22:20:58,342 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 16 [2022-11-25 22:20:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:58,342 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2022-11-25 22:20:58,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2022-11-25 22:20:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2022-11-25 22:20:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:20:58,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:58,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:58,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 22:20:58,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:58,345 INFO L85 PathProgramCache]: Analyzing trace with hash -533289743, now seen corresponding path program 1 times [2022-11-25 22:20:58,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:58,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108603835] [2022-11-25 22:20:58,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:58,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:58,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108603835] [2022-11-25 22:20:58,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108603835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:58,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:58,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808841718] [2022-11-25 22:20:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:58,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,419 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2022-11-25 22:20:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:58,436 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-11-25 22:20:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:58,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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 [2022-11-25 22:20:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:58,439 INFO L225 Difference]: With dead ends: 39 [2022-11-25 22:20:58,439 INFO L226 Difference]: Without dead ends: 37 [2022-11-25 22:20:58,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,440 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:58,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 86 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-25 22:20:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-11-25 22:20:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2022-11-25 22:20:58,447 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 17 [2022-11-25 22:20:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:58,449 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2022-11-25 22:20:58,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2022-11-25 22:20:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2022-11-25 22:20:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:20:58,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:20:58,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:58,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 22:20:58,454 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:20:58,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:20:58,455 INFO L85 PathProgramCache]: Analyzing trace with hash 648103278, now seen corresponding path program 1 times [2022-11-25 22:20:58,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:20:58,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161150956] [2022-11-25 22:20:58,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:20:58,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:20:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:20:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:20:58,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:20:58,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161150956] [2022-11-25 22:20:58,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161150956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:20:58,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:20:58,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:20:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470334167] [2022-11-25 22:20:58,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:20:58,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:20:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:20:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:20:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,530 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:20:58,562 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-11-25 22:20:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:20:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 22:20:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:20:58,564 INFO L225 Difference]: With dead ends: 33 [2022-11-25 22:20:58,564 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 22:20:58,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:20:58,566 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:20:58,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 77 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:20:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 22:20:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 22:20:58,568 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) [2022-11-25 22:20:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 22:20:58,568 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-11-25 22:20:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:20:58,569 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 22:20:58,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:20:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 22:20:58,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 22:20:58,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 22:20:58,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 22:20:58,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 22:20:58,591 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2022-11-25 22:20:58,591 INFO L899 garLoopResultBuilder]: For program point L168(line 168) no Hoare annotation was computed. [2022-11-25 22:20:58,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 22:20:58,592 INFO L899 garLoopResultBuilder]: For program point L152-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,592 INFO L899 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2022-11-25 22:20:58,592 INFO L902 garLoopResultBuilder]: At program point L203(lines 7 207) the Hoare annotation is: true [2022-11-25 22:20:58,592 INFO L899 garLoopResultBuilder]: For program point L137-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,593 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,593 INFO L899 garLoopResultBuilder]: For program point L138(line 138) no Hoare annotation was computed. [2022-11-25 22:20:58,593 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-11-25 22:20:58,593 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,593 INFO L902 garLoopResultBuilder]: At program point L206(lines 6 207) the Hoare annotation is: true [2022-11-25 22:20:58,594 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-11-25 22:20:58,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 22:20:58,594 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,594 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-11-25 22:20:58,594 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,595 INFO L899 garLoopResultBuilder]: For program point L192-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,598 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-11-25 22:20:58,599 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-11-25 22:20:58,599 INFO L899 garLoopResultBuilder]: For program point L177-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,599 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2022-11-25 22:20:58,599 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,599 INFO L899 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2022-11-25 22:20:58,600 INFO L899 garLoopResultBuilder]: For program point L147-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,600 INFO L902 garLoopResultBuilder]: At program point L197-1(lines 50 202) the Hoare annotation is: true [2022-11-25 22:20:58,600 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2022-11-25 22:20:58,602 INFO L899 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2022-11-25 22:20:58,602 INFO L899 garLoopResultBuilder]: For program point L198(line 198) no Hoare annotation was computed. [2022-11-25 22:20:58,602 INFO L895 garLoopResultBuilder]: At program point L198-1(lines 7 207) the Hoare annotation is: false [2022-11-25 22:20:58,603 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,603 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-11-25 22:20:58,603 INFO L899 garLoopResultBuilder]: For program point L167-1(lines 50 202) no Hoare annotation was computed. [2022-11-25 22:20:58,607 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:20:58,609 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 22:20:58,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 10:20:58 BoogieIcfgContainer [2022-11-25 22:20:58,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 22:20:58,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 22:20:58,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 22:20:58,621 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 22:20:58,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:20:56" (3/4) ... [2022-11-25 22:20:58,625 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 22:20:58,641 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 22:20:58,641 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-25 22:20:58,642 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 22:20:58,642 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 22:20:58,707 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 22:20:58,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 22:20:58,708 INFO L158 Benchmark]: Toolchain (without parser) took 3553.40ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 84.5MB in the beginning and 130.7MB in the end (delta: -46.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:20:58,709 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:20:58,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.59ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 73.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 22:20:58,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.25ms. Allocated memory is still 125.8MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:20:58,710 INFO L158 Benchmark]: Boogie Preprocessor took 51.52ms. Allocated memory is still 125.8MB. Free memory was 71.3MB in the beginning and 69.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:20:58,711 INFO L158 Benchmark]: RCFGBuilder took 715.47ms. Allocated memory is still 125.8MB. Free memory was 69.6MB in the beginning and 83.5MB in the end (delta: -13.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-25 22:20:58,711 INFO L158 Benchmark]: TraceAbstraction took 2310.48ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 82.7MB in the beginning and 135.9MB in the end (delta: -53.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:20:58,712 INFO L158 Benchmark]: Witness Printer took 87.52ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 130.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 22:20:58,715 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.20ms. Allocated memory is still 98.6MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.59ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 73.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.25ms. Allocated memory is still 125.8MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.52ms. Allocated memory is still 125.8MB. Free memory was 71.3MB in the beginning and 69.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 715.47ms. Allocated memory is still 125.8MB. Free memory was 69.6MB in the beginning and 83.5MB in the end (delta: -13.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2310.48ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 82.7MB in the beginning and 135.9MB in the end (delta: -53.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 87.52ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 130.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 205]: 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: 2.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 509 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 1509 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 921 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 588 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 204 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 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, 1.0s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 22:20:58,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c7edb5-0d06-4ead-b2fe-08f9d0bee9e8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE