./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe9d78f75108492828570ec5eb222efdf0cf36e1ec4bcab23f2d45d29dbfe193 --- 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-5e519f3 [2022-11-02 20:23:49,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:23:49,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:23:49,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:23:49,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:23:49,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:23:49,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:23:49,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:23:49,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:23:49,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:23:49,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:23:49,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:23:49,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:23:49,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:23:49,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:23:49,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:23:49,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:23:49,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:23:49,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:23:49,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:23:49,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:23:49,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:23:49,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:23:49,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:23:49,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:23:49,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:23:49,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:23:49,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:23:49,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:23:49,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:23:49,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:23:49,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:23:49,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:23:49,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:23:49,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:23:49,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:23:49,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:23:49,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:23:49,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:23:49,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:23:49,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:23:49,211 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:23:49,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:23:49,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:23:49,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:23:49,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:23:49,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:23:49,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:23:49,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:23:49,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:23:49,262 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:23:49,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:23:49,263 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:23:49,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:23:49,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:23:49,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:23:49,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:23:49,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:23:49,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:23:49,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:23:49,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:23:49,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:23:49,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:23:49,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:23:49,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:23:49,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:23:49,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:23:49,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:23:49,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:23:49,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:23:49,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:23:49,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:23:49,268 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:23:49,268 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:23:49,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:23:49,269 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_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/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_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe9d78f75108492828570ec5eb222efdf0cf36e1ec4bcab23f2d45d29dbfe193 [2022-11-02 20:23:49,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:23:49,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:23:49,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:23:49,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:23:49,663 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:23:49,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c [2022-11-02 20:23:49,736 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/data/e37088494/0556e8cbda1248a5b97ef14ef1a8dfef/FLAG806636262 [2022-11-02 20:23:50,375 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:23:50,380 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c [2022-11-02 20:23:50,399 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/data/e37088494/0556e8cbda1248a5b97ef14ef1a8dfef/FLAG806636262 [2022-11-02 20:23:50,624 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/data/e37088494/0556e8cbda1248a5b97ef14ef1a8dfef [2022-11-02 20:23:50,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:23:50,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:23:50,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:23:50,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:23:50,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:23:50,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:23:50" (1/1) ... [2022-11-02 20:23:50,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b1b5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:50, skipping insertion in model container [2022-11-02 20:23:50,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:23:50" (1/1) ... [2022-11-02 20:23:50,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:23:50,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:23:51,201 WARN L230 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_485088ee-d731-4beb-b958-bd8414d1557d/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c[30996,31009] [2022-11-02 20:23:51,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:23:51,215 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:23:51,312 WARN L230 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_485088ee-d731-4beb-b958-bd8414d1557d/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c[30996,31009] [2022-11-02 20:23:51,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:23:51,331 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:23:51,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51 WrapperNode [2022-11-02 20:23:51,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:23:51,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:23:51,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:23:51,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:23:51,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,456 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1007 [2022-11-02 20:23:51,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:23:51,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:23:51,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:23:51,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:23:51,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,506 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:23:51,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:23:51,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:23:51,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:23:51,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (1/1) ... [2022-11-02 20:23:51,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:23:51,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:51,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:23:51,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485088ee-d731-4beb-b958-bd8414d1557d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:23:51,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:23:51,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:23:51,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:23:51,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:23:51,853 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:23:51,871 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:23:53,123 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:23:53,149 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:23:53,149 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:23:53,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:23:53 BoogieIcfgContainer [2022-11-02 20:23:53,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:23:53,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:23:53,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:23:53,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:23:53,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:23:50" (1/3) ... [2022-11-02 20:23:53,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9906f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:23:53, skipping insertion in model container [2022-11-02 20:23:53,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:51" (2/3) ... [2022-11-02 20:23:53,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9906f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:23:53, skipping insertion in model container [2022-11-02 20:23:53,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:23:53" (3/3) ... [2022-11-02 20:23:53,166 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c [2022-11-02 20:23:53,193 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:23:53,193 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:23:53,316 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:23:53,327 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1bc1deb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:23:53,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:23:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 324 states, 322 states have (on average 1.8074534161490683) internal successors, (582), 323 states have internal predecessors, (582), 0 states have call successors, (0), 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-02 20:23:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:23:53,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:53,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:53,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1105173396, now seen corresponding path program 1 times [2022-11-02 20:23:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:53,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845359462] [2022-11-02 20:23:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:53,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:53,753 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-02 20:23:53,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:53,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845359462] [2022-11-02 20:23:53,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845359462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:53,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:53,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:23:53,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846293222] [2022-11-02 20:23:53,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:53,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:23:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:53,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:23:53,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:23:53,802 INFO L87 Difference]: Start difference. First operand has 324 states, 322 states have (on average 1.8074534161490683) internal successors, (582), 323 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:53,856 INFO L93 Difference]: Finished difference Result 453 states and 802 transitions. [2022-11-02 20:23:53,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:23:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-11-02 20:23:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:53,874 INFO L225 Difference]: With dead ends: 453 [2022-11-02 20:23:53,874 INFO L226 Difference]: Without dead ends: 320 [2022-11-02 20:23:53,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:23:53,882 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:53,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-02 20:23:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2022-11-02 20:23:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.8025078369905956) internal successors, (575), 319 states have internal predecessors, (575), 0 states have call successors, (0), 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-02 20:23:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 575 transitions. [2022-11-02 20:23:53,966 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 575 transitions. Word has length 77 [2022-11-02 20:23:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:53,968 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 575 transitions. [2022-11-02 20:23:53,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 575 transitions. [2022-11-02 20:23:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:23:53,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:53,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:53,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:23:53,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash 971159890, now seen corresponding path program 1 times [2022-11-02 20:23:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:53,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123904174] [2022-11-02 20:23:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:53,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:54,389 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-02 20:23:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:54,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123904174] [2022-11-02 20:23:54,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123904174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:54,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:54,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:23:54,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606634965] [2022-11-02 20:23:54,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:54,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:23:54,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:54,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:23:54,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:23:54,395 INFO L87 Difference]: Start difference. First operand 320 states and 575 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:54,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:54,524 INFO L93 Difference]: Finished difference Result 448 states and 792 transitions. [2022-11-02 20:23:54,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:23:54,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-11-02 20:23:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:54,528 INFO L225 Difference]: With dead ends: 448 [2022-11-02 20:23:54,528 INFO L226 Difference]: Without dead ends: 320 [2022-11-02 20:23:54,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:23:54,530 INFO L413 NwaCegarLoop]: 573 mSDtfsCounter, 3 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:54,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2243 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:23:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-02 20:23:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2022-11-02 20:23:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.658307210031348) internal successors, (529), 319 states have internal predecessors, (529), 0 states have call successors, (0), 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-02 20:23:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 529 transitions. [2022-11-02 20:23:54,567 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 529 transitions. Word has length 77 [2022-11-02 20:23:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:54,570 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 529 transitions. [2022-11-02 20:23:54,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 529 transitions. [2022-11-02 20:23:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-02 20:23:54,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:54,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:54,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:23:54,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash 750751880, now seen corresponding path program 1 times [2022-11-02 20:23:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:54,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462307906] [2022-11-02 20:23:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:54,784 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-02 20:23:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462307906] [2022-11-02 20:23:54,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462307906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:54,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:54,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:23:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761216865] [2022-11-02 20:23:54,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:54,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:54,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:54,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:54,787 INFO L87 Difference]: Start difference. First operand 320 states and 529 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-02 20:23:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:54,846 INFO L93 Difference]: Finished difference Result 556 states and 933 transitions. [2022-11-02 20:23:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:54,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2022-11-02 20:23:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:54,852 INFO L225 Difference]: With dead ends: 556 [2022-11-02 20:23:54,853 INFO L226 Difference]: Without dead ends: 432 [2022-11-02 20:23:54,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:54,859 INFO L413 NwaCegarLoop]: 524 mSDtfsCounter, 183 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:54,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 998 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-11-02 20:23:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2022-11-02 20:23:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.6643356643356644) internal successors, (714), 429 states have internal predecessors, (714), 0 states have call successors, (0), 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-02 20:23:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 714 transitions. [2022-11-02 20:23:54,893 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 714 transitions. Word has length 122 [2022-11-02 20:23:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:54,895 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 714 transitions. [2022-11-02 20:23:54,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-02 20:23:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 714 transitions. [2022-11-02 20:23:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-02 20:23:54,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:54,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:54,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:23:54,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:54,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash -44233893, now seen corresponding path program 1 times [2022-11-02 20:23:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:54,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131473784] [2022-11-02 20:23:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:55,178 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-02 20:23:55,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:55,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131473784] [2022-11-02 20:23:55,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131473784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:55,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:55,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:23:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282847239] [2022-11-02 20:23:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:55,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:55,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:55,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:55,181 INFO L87 Difference]: Start difference. First operand 430 states and 714 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-02 20:23:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:55,228 INFO L93 Difference]: Finished difference Result 878 states and 1474 transitions. [2022-11-02 20:23:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2022-11-02 20:23:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:55,236 INFO L225 Difference]: With dead ends: 878 [2022-11-02 20:23:55,237 INFO L226 Difference]: Without dead ends: 644 [2022-11-02 20:23:55,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:55,250 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 184 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:55,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1010 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-11-02 20:23:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2022-11-02 20:23:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.673946957878315) internal successors, (1073), 641 states have internal predecessors, (1073), 0 states have call successors, (0), 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-02 20:23:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1073 transitions. [2022-11-02 20:23:55,295 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1073 transitions. Word has length 125 [2022-11-02 20:23:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:55,297 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 1073 transitions. [2022-11-02 20:23:55,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-02 20:23:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1073 transitions. [2022-11-02 20:23:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 20:23:55,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:55,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:55,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:23:55,301 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash 487395088, now seen corresponding path program 1 times [2022-11-02 20:23:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:55,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964965253] [2022-11-02 20:23:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:55,511 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-02 20:23:55,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:55,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964965253] [2022-11-02 20:23:55,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964965253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:55,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:55,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:23:55,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665993012] [2022-11-02 20:23:55,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:55,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:55,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:55,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:55,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:55,518 INFO L87 Difference]: Start difference. First operand 642 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:55,562 INFO L93 Difference]: Finished difference Result 1494 states and 2515 transitions. [2022-11-02 20:23:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-11-02 20:23:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:55,570 INFO L225 Difference]: With dead ends: 1494 [2022-11-02 20:23:55,570 INFO L226 Difference]: Without dead ends: 1048 [2022-11-02 20:23:55,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:55,578 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 177 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:55,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1011 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-11-02 20:23:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1046. [2022-11-02 20:23:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 1.677511961722488) internal successors, (1753), 1045 states have internal predecessors, (1753), 0 states have call successors, (0), 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-02 20:23:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1753 transitions. [2022-11-02 20:23:55,623 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1753 transitions. Word has length 128 [2022-11-02 20:23:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:55,624 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1753 transitions. [2022-11-02 20:23:55,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1753 transitions. [2022-11-02 20:23:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-02 20:23:55,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:55,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:55,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:23:55,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:55,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1255785821, now seen corresponding path program 1 times [2022-11-02 20:23:55,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:55,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142675235] [2022-11-02 20:23:55,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:55,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:55,868 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-02 20:23:55,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:55,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142675235] [2022-11-02 20:23:55,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142675235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:55,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:55,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:23:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852369309] [2022-11-02 20:23:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:55,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:55,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:55,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:55,871 INFO L87 Difference]: Start difference. First operand 1046 states and 1753 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:55,930 INFO L93 Difference]: Finished difference Result 2666 states and 4483 transitions. [2022-11-02 20:23:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:55,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-11-02 20:23:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:55,938 INFO L225 Difference]: With dead ends: 2666 [2022-11-02 20:23:55,938 INFO L226 Difference]: Without dead ends: 1816 [2022-11-02 20:23:55,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:55,944 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 170 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:55,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1012 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2022-11-02 20:23:56,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1814. [2022-11-02 20:23:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 1.6751241036955322) internal successors, (3037), 1813 states have internal predecessors, (3037), 0 states have call successors, (0), 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-02 20:23:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 3037 transitions. [2022-11-02 20:23:56,046 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 3037 transitions. Word has length 131 [2022-11-02 20:23:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:56,046 INFO L495 AbstractCegarLoop]: Abstraction has 1814 states and 3037 transitions. [2022-11-02 20:23:56,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 3037 transitions. [2022-11-02 20:23:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 20:23:56,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:56,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:56,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:23:56,050 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:56,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash 871480728, now seen corresponding path program 1 times [2022-11-02 20:23:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:56,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734878212] [2022-11-02 20:23:56,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:56,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:56,346 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-02 20:23:56,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:56,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734878212] [2022-11-02 20:23:56,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734878212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:56,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:56,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:23:56,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542519735] [2022-11-02 20:23:56,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:56,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:23:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:56,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:23:56,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:23:56,351 INFO L87 Difference]: Start difference. First operand 1814 states and 3037 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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-02 20:23:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:56,927 INFO L93 Difference]: Finished difference Result 9350 states and 15821 transitions. [2022-11-02 20:23:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:23:56,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2022-11-02 20:23:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:56,960 INFO L225 Difference]: With dead ends: 9350 [2022-11-02 20:23:56,961 INFO L226 Difference]: Without dead ends: 7732 [2022-11-02 20:23:56,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:23:56,970 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 1685 mSDsluCounter, 3840 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 4361 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:56,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 4361 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:23:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7732 states. [2022-11-02 20:23:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7732 to 3322. [2022-11-02 20:23:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3322 states, 3321 states have (on average 1.6772056609454984) internal successors, (5570), 3321 states have internal predecessors, (5570), 0 states have call successors, (0), 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-02 20:23:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3322 states to 3322 states and 5570 transitions. [2022-11-02 20:23:57,211 INFO L78 Accepts]: Start accepts. Automaton has 3322 states and 5570 transitions. Word has length 134 [2022-11-02 20:23:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:57,212 INFO L495 AbstractCegarLoop]: Abstraction has 3322 states and 5570 transitions. [2022-11-02 20:23:57,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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-02 20:23:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 5570 transitions. [2022-11-02 20:23:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:23:57,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:57,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:57,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:23:57,217 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:57,217 INFO L85 PathProgramCache]: Analyzing trace with hash -848507773, now seen corresponding path program 1 times [2022-11-02 20:23:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:57,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881539603] [2022-11-02 20:23:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:57,383 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-02 20:23:57,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:57,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881539603] [2022-11-02 20:23:57,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881539603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:57,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:57,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:23:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632904897] [2022-11-02 20:23:57,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:57,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:23:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:23:57,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:23:57,387 INFO L87 Difference]: Start difference. First operand 3322 states and 5570 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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-02 20:23:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:57,674 INFO L93 Difference]: Finished difference Result 9692 states and 16356 transitions. [2022-11-02 20:23:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:23:57,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2022-11-02 20:23:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:57,705 INFO L225 Difference]: With dead ends: 9692 [2022-11-02 20:23:57,705 INFO L226 Difference]: Without dead ends: 6566 [2022-11-02 20:23:57,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:23:57,711 INFO L413 NwaCegarLoop]: 524 mSDtfsCounter, 618 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:57,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1717 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:23:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2022-11-02 20:23:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 4927. [2022-11-02 20:23:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4927 states, 4926 states have (on average 1.6798619569630533) internal successors, (8275), 4926 states have internal predecessors, (8275), 0 states have call successors, (0), 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-02 20:23:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4927 states to 4927 states and 8275 transitions. [2022-11-02 20:23:58,025 INFO L78 Accepts]: Start accepts. Automaton has 4927 states and 8275 transitions. Word has length 135 [2022-11-02 20:23:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:58,026 INFO L495 AbstractCegarLoop]: Abstraction has 4927 states and 8275 transitions. [2022-11-02 20:23:58,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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-02 20:23:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4927 states and 8275 transitions. [2022-11-02 20:23:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:23:58,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:58,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:58,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:23:58,039 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash 942022462, now seen corresponding path program 1 times [2022-11-02 20:23:58,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:58,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078631458] [2022-11-02 20:23:58,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:58,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:58,164 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-02 20:23:58,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:58,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078631458] [2022-11-02 20:23:58,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078631458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:58,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:58,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:23:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145097229] [2022-11-02 20:23:58,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:58,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:58,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:58,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:58,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:58,168 INFO L87 Difference]: Start difference. First operand 4927 states and 8275 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:23:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:58,500 INFO L93 Difference]: Finished difference Result 9527 states and 16015 transitions. [2022-11-02 20:23:58,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:58,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2022-11-02 20:23:58,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:58,551 INFO L225 Difference]: With dead ends: 9527 [2022-11-02 20:23:58,551 INFO L226 Difference]: Without dead ends: 6957 [2022-11-02 20:23:58,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:58,558 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 185 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:58,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1141 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2022-11-02 20:23:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 6955. [2022-11-02 20:23:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6955 states, 6954 states have (on average 1.674000575208513) internal successors, (11641), 6954 states have internal predecessors, (11641), 0 states have call successors, (0), 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-02 20:23:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6955 states to 6955 states and 11641 transitions. [2022-11-02 20:23:58,987 INFO L78 Accepts]: Start accepts. Automaton has 6955 states and 11641 transitions. Word has length 136 [2022-11-02 20:23:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:58,988 INFO L495 AbstractCegarLoop]: Abstraction has 6955 states and 11641 transitions. [2022-11-02 20:23:58,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:23:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6955 states and 11641 transitions. [2022-11-02 20:23:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:23:58,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:58,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:58,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:23:58,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash -506487182, now seen corresponding path program 1 times [2022-11-02 20:23:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:59,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289228378] [2022-11-02 20:23:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:59,191 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-02 20:23:59,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289228378] [2022-11-02 20:23:59,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289228378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:59,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:23:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128458332] [2022-11-02 20:23:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:59,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:59,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:59,194 INFO L87 Difference]: Start difference. First operand 6955 states and 11641 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:23:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:59,581 INFO L93 Difference]: Finished difference Result 13407 states and 22463 transitions. [2022-11-02 20:23:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2022-11-02 20:23:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:59,608 INFO L225 Difference]: With dead ends: 13407 [2022-11-02 20:23:59,608 INFO L226 Difference]: Without dead ends: 9781 [2022-11-02 20:23:59,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:59,616 INFO L413 NwaCegarLoop]: 627 mSDtfsCounter, 178 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:59,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1117 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9781 states. [2022-11-02 20:24:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9781 to 9779. [2022-11-02 20:24:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9779 states, 9778 states have (on average 1.6677234608304357) internal successors, (16307), 9778 states have internal predecessors, (16307), 0 states have call successors, (0), 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-02 20:24:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9779 states to 9779 states and 16307 transitions. [2022-11-02 20:24:00,169 INFO L78 Accepts]: Start accepts. Automaton has 9779 states and 16307 transitions. Word has length 136 [2022-11-02 20:24:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:00,170 INFO L495 AbstractCegarLoop]: Abstraction has 9779 states and 16307 transitions. [2022-11-02 20:24:00,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:24:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 9779 states and 16307 transitions. [2022-11-02 20:24:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:24:00,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:00,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:00,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:24:00,174 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:00,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2094526018, now seen corresponding path program 1 times [2022-11-02 20:24:00,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:00,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551072057] [2022-11-02 20:24:00,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:00,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:00,330 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-02 20:24:00,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:00,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551072057] [2022-11-02 20:24:00,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551072057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:00,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:00,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110108988] [2022-11-02 20:24:00,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:00,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:00,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:00,333 INFO L87 Difference]: Start difference. First operand 9779 states and 16307 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:24:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:00,991 INFO L93 Difference]: Finished difference Result 18739 states and 31281 transitions. [2022-11-02 20:24:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2022-11-02 20:24:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:01,031 INFO L225 Difference]: With dead ends: 18739 [2022-11-02 20:24:01,031 INFO L226 Difference]: Without dead ends: 13643 [2022-11-02 20:24:01,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:01,041 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 171 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:01,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1093 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:24:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13643 states. [2022-11-02 20:24:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13643 to 13641. [2022-11-02 20:24:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13641 states, 13640 states have (on average 1.6607771260997068) internal successors, (22653), 13640 states have internal predecessors, (22653), 0 states have call successors, (0), 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-02 20:24:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13641 states to 13641 states and 22653 transitions. [2022-11-02 20:24:01,904 INFO L78 Accepts]: Start accepts. Automaton has 13641 states and 22653 transitions. Word has length 136 [2022-11-02 20:24:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:01,906 INFO L495 AbstractCegarLoop]: Abstraction has 13641 states and 22653 transitions. [2022-11-02 20:24:01,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:24:01,907 INFO L276 IsEmpty]: Start isEmpty. Operand 13641 states and 22653 transitions. [2022-11-02 20:24:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:24:01,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:01,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:01,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:24:01,910 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1835427887, now seen corresponding path program 1 times [2022-11-02 20:24:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:01,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199275054] [2022-11-02 20:24:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:02,101 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-02 20:24:02,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:02,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199275054] [2022-11-02 20:24:02,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199275054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:02,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:02,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874826200] [2022-11-02 20:24:02,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:02,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:02,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:02,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:02,105 INFO L87 Difference]: Start difference. First operand 13641 states and 22653 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:24:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:03,481 INFO L93 Difference]: Finished difference Result 44058 states and 73290 transitions. [2022-11-02 20:24:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:03,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2022-11-02 20:24:03,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:03,570 INFO L225 Difference]: With dead ends: 44058 [2022-11-02 20:24:03,570 INFO L226 Difference]: Without dead ends: 30777 [2022-11-02 20:24:03,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:24:03,592 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 617 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:03,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1713 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:24:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30777 states. [2022-11-02 20:24:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30777 to 22155. [2022-11-02 20:24:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22155 states, 22154 states have (on average 1.6551864223165116) internal successors, (36669), 22154 states have internal predecessors, (36669), 0 states have call successors, (0), 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-02 20:24:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22155 states to 22155 states and 36669 transitions. [2022-11-02 20:24:05,340 INFO L78 Accepts]: Start accepts. Automaton has 22155 states and 36669 transitions. Word has length 136 [2022-11-02 20:24:05,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:05,341 INFO L495 AbstractCegarLoop]: Abstraction has 22155 states and 36669 transitions. [2022-11-02 20:24:05,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:24:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 22155 states and 36669 transitions. [2022-11-02 20:24:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:24:05,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:05,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:05,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:24:05,344 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:05,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1829805838, now seen corresponding path program 1 times [2022-11-02 20:24:05,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:05,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938938079] [2022-11-02 20:24:05,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:05,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:05,469 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-02 20:24:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938938079] [2022-11-02 20:24:05,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938938079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:05,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:05,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:24:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145773387] [2022-11-02 20:24:05,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:05,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:24:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:05,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:24:05,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:05,472 INFO L87 Difference]: Start difference. First operand 22155 states and 36669 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:24:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:07,288 INFO L93 Difference]: Finished difference Result 48794 states and 81139 transitions. [2022-11-02 20:24:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:24:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2022-11-02 20:24:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:07,397 INFO L225 Difference]: With dead ends: 48794 [2022-11-02 20:24:07,398 INFO L226 Difference]: Without dead ends: 33280 [2022-11-02 20:24:07,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:24:07,428 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 192 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:07,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:24:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33280 states. [2022-11-02 20:24:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33280 to 33278. [2022-11-02 20:24:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33278 states, 33277 states have (on average 1.6503591068906451) internal successors, (54919), 33277 states have internal predecessors, (54919), 0 states have call successors, (0), 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-02 20:24:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33278 states to 33278 states and 54919 transitions. [2022-11-02 20:24:09,272 INFO L78 Accepts]: Start accepts. Automaton has 33278 states and 54919 transitions. Word has length 136 [2022-11-02 20:24:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:09,272 INFO L495 AbstractCegarLoop]: Abstraction has 33278 states and 54919 transitions. [2022-11-02 20:24:09,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02 20:24:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 33278 states and 54919 transitions. [2022-11-02 20:24:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-02 20:24:09,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:09,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:09,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:24:09,406 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash -692908230, now seen corresponding path program 1 times [2022-11-02 20:24:09,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:09,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904923649] [2022-11-02 20:24:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:09,574 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-02 20:24:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:09,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904923649] [2022-11-02 20:24:09,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904923649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:09,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:09,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463188246] [2022-11-02 20:24:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:09,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:09,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:09,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:09,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:09,577 INFO L87 Difference]: Start difference. First operand 33278 states and 54919 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:12,825 INFO L93 Difference]: Finished difference Result 108186 states and 178737 transitions. [2022-11-02 20:24:12,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:12,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-11-02 20:24:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:13,054 INFO L225 Difference]: With dead ends: 108186 [2022-11-02 20:24:13,054 INFO L226 Difference]: Without dead ends: 75154 [2022-11-02 20:24:13,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:24:13,113 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 615 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:13,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1715 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:24:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75154 states. [2022-11-02 20:24:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75154 to 54073. [2022-11-02 20:24:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54073 states, 54072 states have (on average 1.6433459091581595) internal successors, (88859), 54072 states have internal predecessors, (88859), 0 states have call successors, (0), 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-02 20:24:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54073 states to 54073 states and 88859 transitions. [2022-11-02 20:24:15,643 INFO L78 Accepts]: Start accepts. Automaton has 54073 states and 88859 transitions. Word has length 137 [2022-11-02 20:24:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:15,644 INFO L495 AbstractCegarLoop]: Abstraction has 54073 states and 88859 transitions. [2022-11-02 20:24:15,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 54073 states and 88859 transitions. [2022-11-02 20:24:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-02 20:24:15,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:15,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:15,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:24:15,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:15,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1592912186, now seen corresponding path program 1 times [2022-11-02 20:24:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:15,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441325818] [2022-11-02 20:24:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:15,809 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-02 20:24:15,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:15,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441325818] [2022-11-02 20:24:15,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441325818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:15,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:15,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:15,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289471161] [2022-11-02 20:24:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:15,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:15,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:15,812 INFO L87 Difference]: Start difference. First operand 54073 states and 88859 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:20,392 INFO L93 Difference]: Finished difference Result 173820 states and 285957 transitions. [2022-11-02 20:24:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:20,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-11-02 20:24:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:20,696 INFO L225 Difference]: With dead ends: 173820 [2022-11-02 20:24:20,696 INFO L226 Difference]: Without dead ends: 119993 [2022-11-02 20:24:20,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:24:20,787 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 613 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:20,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1717 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:24:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119993 states. [2022-11-02 20:24:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119993 to 86808. [2022-11-02 20:24:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86808 states, 86807 states have (on average 1.6364924487656525) internal successors, (142059), 86807 states have internal predecessors, (142059), 0 states have call successors, (0), 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-02 20:24:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86808 states to 86808 states and 142059 transitions. [2022-11-02 20:24:24,883 INFO L78 Accepts]: Start accepts. Automaton has 86808 states and 142059 transitions. Word has length 138 [2022-11-02 20:24:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:24,884 INFO L495 AbstractCegarLoop]: Abstraction has 86808 states and 142059 transitions. [2022-11-02 20:24:24,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 86808 states and 142059 transitions. [2022-11-02 20:24:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:24:24,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:24,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:24,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:24:24,887 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 298565918, now seen corresponding path program 1 times [2022-11-02 20:24:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:24,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191844298] [2022-11-02 20:24:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:25,307 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-02 20:24:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:25,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191844298] [2022-11-02 20:24:25,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191844298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:25,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:25,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:24:25,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930059113] [2022-11-02 20:24:25,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:25,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:24:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:25,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:24:25,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:24:25,313 INFO L87 Difference]: Start difference. First operand 86808 states and 142059 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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-02 20:24:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:29,488 INFO L93 Difference]: Finished difference Result 173372 states and 283726 transitions. [2022-11-02 20:24:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:24:29,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2022-11-02 20:24:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:29,706 INFO L225 Difference]: With dead ends: 173372 [2022-11-02 20:24:29,706 INFO L226 Difference]: Without dead ends: 86810 [2022-11-02 20:24:29,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:24:29,780 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 672 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:29,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1990 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:24:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86810 states. [2022-11-02 20:24:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86810 to 86808. [2022-11-02 20:24:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86808 states, 86807 states have (on average 1.629292568571659) internal successors, (141434), 86807 states have internal predecessors, (141434), 0 states have call successors, (0), 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-02 20:24:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86808 states to 86808 states and 141434 transitions. [2022-11-02 20:24:33,654 INFO L78 Accepts]: Start accepts. Automaton has 86808 states and 141434 transitions. Word has length 140 [2022-11-02 20:24:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:33,655 INFO L495 AbstractCegarLoop]: Abstraction has 86808 states and 141434 transitions. [2022-11-02 20:24:33,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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-02 20:24:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 86808 states and 141434 transitions. [2022-11-02 20:24:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-02 20:24:33,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:33,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:33,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:24:33,657 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1347255107, now seen corresponding path program 1 times [2022-11-02 20:24:33,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:33,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958400106] [2022-11-02 20:24:33,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:33,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:34,009 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-02 20:24:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:34,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958400106] [2022-11-02 20:24:34,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958400106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:34,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:34,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:24:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955416417] [2022-11-02 20:24:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:34,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:24:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:34,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:24:34,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:24:34,011 INFO L87 Difference]: Start difference. First operand 86808 states and 141434 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)