./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/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_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/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_a3613814-b4d9-42ee-a6db-c80a71abadc3/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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- 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:58:33,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:58:33,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:58:33,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:58:33,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:58:33,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:58:33,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:58:33,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:58:33,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:58:33,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:58:33,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:58:33,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:58:33,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:58:33,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:58:33,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:58:33,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:58:33,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:58:33,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:58:33,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:58:33,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:58:33,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:58:33,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:58:33,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:58:33,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:58:33,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:58:33,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:58:33,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:58:33,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:58:33,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:58:33,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:58:33,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:58:33,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:58:33,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:58:33,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:58:33,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:58:33,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:58:33,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:58:33,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:58:33,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:58:33,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:58:33,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:58:33,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:58:33,679 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:58:33,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:58:33,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:58:33,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:58:33,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:58:33,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:58:33,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:58:33,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:58:33,690 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:58:33,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:58:33,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:58:33,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:58:33,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:58:33,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:58:33,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:58:33,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:58:33,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:58:33,693 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:58:33,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:58:33,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:58:33,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:58:33,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:58:33,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:58:33,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:58:33,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:33,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:58:33,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:58:33,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:58:33,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:58:33,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:58:33,707 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:58:33,708 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:58:33,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:58:33,708 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_a3613814-b4d9-42ee-a6db-c80a71abadc3/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_a3613814-b4d9-42ee-a6db-c80a71abadc3/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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2022-11-02 20:58:33,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:58:33,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:58:33,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:58:33,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:58:33,979 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:58:33,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/locks/test_locks_8.c [2022-11-02 20:58:34,047 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/data/1616f5953/4fa0063a2a7a49e0abd6d49787894028/FLAG458d648d3 [2022-11-02 20:58:34,492 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:58:34,492 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/sv-benchmarks/c/locks/test_locks_8.c [2022-11-02 20:58:34,510 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/data/1616f5953/4fa0063a2a7a49e0abd6d49787894028/FLAG458d648d3 [2022-11-02 20:58:34,893 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/data/1616f5953/4fa0063a2a7a49e0abd6d49787894028 [2022-11-02 20:58:34,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:58:34,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:58:34,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:34,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:58:34,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:58:34,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:34" (1/1) ... [2022-11-02 20:58:34,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df4489f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:34, skipping insertion in model container [2022-11-02 20:58:34,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:34" (1/1) ... [2022-11-02 20:58:34,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:58:34,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:58:35,160 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_a3613814-b4d9-42ee-a6db-c80a71abadc3/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-11-02 20:58:35,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:35,177 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:58:35,225 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_a3613814-b4d9-42ee-a6db-c80a71abadc3/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-11-02 20:58:35,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:35,248 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:58:35,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35 WrapperNode [2022-11-02 20:58:35,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:35,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:35,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:58:35,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:58:35,258 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:58:35" (1/1) ... [2022-11-02 20:58:35,265 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:58:35" (1/1) ... [2022-11-02 20:58:35,292 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2022-11-02 20:58:35,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:35,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:58:35,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:58:35,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:58:35,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (1/1) ... [2022-11-02 20:58:35,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (1/1) ... [2022-11-02 20:58:35,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (1/1) ... [2022-11-02 20:58:35,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (1/1) ... [2022-11-02 20:58:35,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (1/1) ... [2022-11-02 20:58:35,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (1/1) ... [2022-11-02 20:58:35,336 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (1/1) ... [2022-11-02 20:58:35,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (1/1) ... [2022-11-02 20:58:35,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:58:35,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:58:35,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:58:35,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:58:35,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (1/1) ... [2022-11-02 20:58:35,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:35,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:35,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:58:35,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:58:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:58:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:58:35,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:58:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:58:35,483 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:58:35,484 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:58:35,674 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:58:35,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:58:35,688 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:58:35,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:35 BoogieIcfgContainer [2022-11-02 20:58:35,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:58:35,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:58:35,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:58:35,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:58:35,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:58:34" (1/3) ... [2022-11-02 20:58:35,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fd863a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:35, skipping insertion in model container [2022-11-02 20:58:35,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:35" (2/3) ... [2022-11-02 20:58:35,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fd863a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:35, skipping insertion in model container [2022-11-02 20:58:35,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:35" (3/3) ... [2022-11-02 20:58:35,707 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-11-02 20:58:35,733 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:58:35,733 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:58:35,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:58:35,830 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;@172d89c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:58:35,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:58:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:58:35,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:35,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:35,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1577492323, now seen corresponding path program 1 times [2022-11-02 20:58:35,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:35,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747584365] [2022-11-02 20:58:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,172 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:58:36,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:36,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747584365] [2022-11-02 20:58:36,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747584365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:36,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:36,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:36,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630290725] [2022-11-02 20:58:36,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:36,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:36,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:36,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:36,228 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:36,266 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. [2022-11-02 20:58:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:36,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 20:58:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:36,278 INFO L225 Difference]: With dead ends: 71 [2022-11-02 20:58:36,278 INFO L226 Difference]: Without dead ends: 57 [2022-11-02 20:58:36,281 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:58:36,285 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:36,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-02 20:58:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2022-11-02 20:58:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2022-11-02 20:58:36,369 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2022-11-02 20:58:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:36,370 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2022-11-02 20:58:36,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2022-11-02 20:58:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:58:36,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:36,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:36,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:58:36,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash -876427745, now seen corresponding path program 1 times [2022-11-02 20:58:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:36,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125740208] [2022-11-02 20:58:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,493 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:58:36,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125740208] [2022-11-02 20:58:36,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125740208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:36,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:36,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086366251] [2022-11-02 20:58:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:36,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:36,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:36,497 INFO L87 Difference]: Start difference. First operand 39 states and 70 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:36,532 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2022-11-02 20:58:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:36,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 20:58:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:36,534 INFO L225 Difference]: With dead ends: 94 [2022-11-02 20:58:36,539 INFO L226 Difference]: Without dead ends: 57 [2022-11-02 20:58:36,540 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:58:36,541 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:36,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-02 20:58:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-11-02 20:58:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-11-02 20:58:36,557 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2022-11-02 20:58:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:36,558 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-11-02 20:58:36,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-11-02 20:58:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:58:36,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:36,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:36,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:58:36,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1657407761, now seen corresponding path program 1 times [2022-11-02 20:58:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:36,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125506968] [2022-11-02 20:58:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,622 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:58:36,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:36,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125506968] [2022-11-02 20:58:36,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125506968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:36,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:36,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:36,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910134061] [2022-11-02 20:58:36,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:36,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:36,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:36,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:36,625 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:36,645 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2022-11-02 20:58:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:36,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:58:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:36,646 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:58:36,646 INFO L226 Difference]: Without dead ends: 60 [2022-11-02 20:58:36,647 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:58:36,648 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:36,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-02 20:58:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-11-02 20:58:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2022-11-02 20:58:36,657 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2022-11-02 20:58:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:36,657 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2022-11-02 20:58:36,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2022-11-02 20:58:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:58:36,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:36,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:36,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:58:36,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1399242323, now seen corresponding path program 1 times [2022-11-02 20:58:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:36,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905068276] [2022-11-02 20:58:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,703 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:58:36,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:36,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905068276] [2022-11-02 20:58:36,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905068276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:36,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:36,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:36,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450834969] [2022-11-02 20:58:36,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:36,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:36,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:36,706 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:36,723 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2022-11-02 20:58:36,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:58:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:36,725 INFO L225 Difference]: With dead ends: 109 [2022-11-02 20:58:36,725 INFO L226 Difference]: Without dead ends: 107 [2022-11-02 20:58:36,726 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:58:36,727 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:36,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-02 20:58:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2022-11-02 20:58:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2022-11-02 20:58:36,738 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 16 [2022-11-02 20:58:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:36,738 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2022-11-02 20:58:36,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2022-11-02 20:58:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:58:36,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:36,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:36,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:58:36,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:36,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:36,741 INFO L85 PathProgramCache]: Analyzing trace with hash -698177745, now seen corresponding path program 1 times [2022-11-02 20:58:36,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:36,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693180781] [2022-11-02 20:58:36,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:36,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,779 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:58:36,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:36,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693180781] [2022-11-02 20:58:36,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693180781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:36,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:36,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942444804] [2022-11-02 20:58:36,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:36,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:36,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:36,782 INFO L87 Difference]: Start difference. First operand 77 states and 133 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:36,803 INFO L93 Difference]: Finished difference Result 181 states and 315 transitions. [2022-11-02 20:58:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:36,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:58:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:36,805 INFO L225 Difference]: With dead ends: 181 [2022-11-02 20:58:36,805 INFO L226 Difference]: Without dead ends: 109 [2022-11-02 20:58:36,805 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:58:36,807 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:36,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 116 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-02 20:58:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-11-02 20:58:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2022-11-02 20:58:36,820 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2022-11-02 20:58:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:36,821 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2022-11-02 20:58:36,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2022-11-02 20:58:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:58:36,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:36,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:36,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:58:36,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash -426624716, now seen corresponding path program 1 times [2022-11-02 20:58:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:36,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014897803] [2022-11-02 20:58:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,859 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:58:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:36,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014897803] [2022-11-02 20:58:36,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014897803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:36,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:36,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145034620] [2022-11-02 20:58:36,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:36,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:36,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:36,862 INFO L87 Difference]: Start difference. First operand 107 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:36,878 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2022-11-02 20:58:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:58:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:36,880 INFO L225 Difference]: With dead ends: 162 [2022-11-02 20:58:36,880 INFO L226 Difference]: Without dead ends: 111 [2022-11-02 20:58:36,881 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:58:36,882 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 39 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:36,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-02 20:58:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2022-11-02 20:58:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 183 transitions. [2022-11-02 20:58:36,892 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 183 transitions. Word has length 17 [2022-11-02 20:58:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:36,892 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 183 transitions. [2022-11-02 20:58:36,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 183 transitions. [2022-11-02 20:58:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:58:36,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:36,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:36,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:58:36,894 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash -168459278, now seen corresponding path program 1 times [2022-11-02 20:58:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:36,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519446858] [2022-11-02 20:58:36,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:36,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,980 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:58:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:36,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519446858] [2022-11-02 20:58:36,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519446858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:36,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:36,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35266149] [2022-11-02 20:58:36,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:36,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:36,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:36,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:36,983 INFO L87 Difference]: Start difference. First operand 109 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,020 INFO L93 Difference]: Finished difference Result 309 states and 521 transitions. [2022-11-02 20:58:37,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:58:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:37,023 INFO L225 Difference]: With dead ends: 309 [2022-11-02 20:58:37,023 INFO L226 Difference]: Without dead ends: 207 [2022-11-02 20:58:37,024 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:58:37,025 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:37,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-02 20:58:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2022-11-02 20:58:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 339 transitions. [2022-11-02 20:58:37,053 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 339 transitions. Word has length 17 [2022-11-02 20:58:37,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:37,054 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 339 transitions. [2022-11-02 20:58:37,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2022-11-02 20:58:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:58:37,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:37,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:37,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:58:37,064 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:37,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash -869523856, now seen corresponding path program 1 times [2022-11-02 20:58:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:37,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497861096] [2022-11-02 20:58:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,136 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:58:37,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:37,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497861096] [2022-11-02 20:58:37,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497861096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:37,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:37,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043002063] [2022-11-02 20:58:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:37,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:37,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:37,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:37,140 INFO L87 Difference]: Start difference. First operand 205 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,168 INFO L93 Difference]: Finished difference Result 257 states and 429 transitions. [2022-11-02 20:58:37,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:58:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:37,172 INFO L225 Difference]: With dead ends: 257 [2022-11-02 20:58:37,172 INFO L226 Difference]: Without dead ends: 255 [2022-11-02 20:58:37,173 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:58:37,181 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:37,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 134 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-02 20:58:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2022-11-02 20:58:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2022-11-02 20:58:37,217 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 17 [2022-11-02 20:58:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:37,218 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2022-11-02 20:58:37,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2022-11-02 20:58:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:58:37,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:37,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:37,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:58:37,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:37,221 INFO L85 PathProgramCache]: Analyzing trace with hash -927055644, now seen corresponding path program 1 times [2022-11-02 20:58:37,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:37,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138417165] [2022-11-02 20:58:37,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:37,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,275 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:58:37,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:37,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138417165] [2022-11-02 20:58:37,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138417165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:37,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:37,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001221556] [2022-11-02 20:58:37,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:37,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:37,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:37,281 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,311 INFO L93 Difference]: Finished difference Result 373 states and 617 transitions. [2022-11-02 20:58:37,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 20:58:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:37,313 INFO L225 Difference]: With dead ends: 373 [2022-11-02 20:58:37,314 INFO L226 Difference]: Without dead ends: 371 [2022-11-02 20:58:37,314 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:58:37,315 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:37,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 97 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-11-02 20:58:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 289. [2022-11-02 20:58:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 463 transitions. [2022-11-02 20:58:37,331 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 463 transitions. Word has length 18 [2022-11-02 20:58:37,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:37,331 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 463 transitions. [2022-11-02 20:58:37,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,332 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 463 transitions. [2022-11-02 20:58:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:58:37,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:37,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:37,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:58:37,334 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:37,334 INFO L85 PathProgramCache]: Analyzing trace with hash -225991066, now seen corresponding path program 1 times [2022-11-02 20:58:37,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:37,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001881648] [2022-11-02 20:58:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,358 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:58:37,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:37,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001881648] [2022-11-02 20:58:37,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001881648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:37,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:37,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957090181] [2022-11-02 20:58:37,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:37,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:37,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:37,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:37,361 INFO L87 Difference]: Start difference. First operand 289 states and 463 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,379 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2022-11-02 20:58:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 20:58:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:37,381 INFO L225 Difference]: With dead ends: 677 [2022-11-02 20:58:37,381 INFO L226 Difference]: Without dead ends: 395 [2022-11-02 20:58:37,382 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:58:37,383 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:37,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-11-02 20:58:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2022-11-02 20:58:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 619 transitions. [2022-11-02 20:58:37,399 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 619 transitions. Word has length 18 [2022-11-02 20:58:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:37,399 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 619 transitions. [2022-11-02 20:58:37,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 619 transitions. [2022-11-02 20:58:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:58:37,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:37,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:37,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:58:37,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:37,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1326261127, now seen corresponding path program 1 times [2022-11-02 20:58:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:37,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417600560] [2022-11-02 20:58:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,425 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:58:37,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:37,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417600560] [2022-11-02 20:58:37,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417600560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:37,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:37,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:37,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401957224] [2022-11-02 20:58:37,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:37,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:37,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:37,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:37,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:37,427 INFO L87 Difference]: Start difference. First operand 393 states and 619 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,443 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2022-11-02 20:58:37,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:58:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:37,445 INFO L225 Difference]: With dead ends: 597 [2022-11-02 20:58:37,446 INFO L226 Difference]: Without dead ends: 407 [2022-11-02 20:58:37,446 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:58:37,447 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:37,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-02 20:58:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2022-11-02 20:58:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2022-11-02 20:58:37,480 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2022-11-02 20:58:37,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:37,480 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2022-11-02 20:58:37,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2022-11-02 20:58:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:58:37,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:37,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:37,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:58:37,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:37,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:37,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1584426565, now seen corresponding path program 1 times [2022-11-02 20:58:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:37,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306196657] [2022-11-02 20:58:37,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:37,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,505 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:58:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306196657] [2022-11-02 20:58:37,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306196657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:37,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:37,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933626498] [2022-11-02 20:58:37,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:37,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:37,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:37,507 INFO L87 Difference]: Start difference. First operand 405 states and 627 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,530 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2022-11-02 20:58:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:58:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:37,533 INFO L225 Difference]: With dead ends: 713 [2022-11-02 20:58:37,533 INFO L226 Difference]: Without dead ends: 711 [2022-11-02 20:58:37,534 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:58:37,535 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:37,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-02 20:58:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2022-11-02 20:58:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2022-11-02 20:58:37,554 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2022-11-02 20:58:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:37,555 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2022-11-02 20:58:37,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2022-11-02 20:58:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:58:37,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:37,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:37,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:58:37,557 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:37,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2009476153, now seen corresponding path program 1 times [2022-11-02 20:58:37,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:37,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725171345] [2022-11-02 20:58:37,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,580 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:58:37,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:37,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725171345] [2022-11-02 20:58:37,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725171345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:37,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:37,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:37,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538398579] [2022-11-02 20:58:37,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:37,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:37,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:37,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:37,582 INFO L87 Difference]: Start difference. First operand 581 states and 875 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,609 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2022-11-02 20:58:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:58:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:37,613 INFO L225 Difference]: With dead ends: 1337 [2022-11-02 20:58:37,613 INFO L226 Difference]: Without dead ends: 775 [2022-11-02 20:58:37,614 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:58:37,614 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:37,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-11-02 20:58:37,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2022-11-02 20:58:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2022-11-02 20:58:37,641 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2022-11-02 20:58:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:37,641 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2022-11-02 20:58:37,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2022-11-02 20:58:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:58:37,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:37,643 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] [2022-11-02 20:58:37,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:58:37,643 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:37,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1872798619, now seen corresponding path program 1 times [2022-11-02 20:58:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:37,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094892597] [2022-11-02 20:58:37,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,666 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:58:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094892597] [2022-11-02 20:58:37,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094892597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:37,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:37,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158513166] [2022-11-02 20:58:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:37,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:37,668 INFO L87 Difference]: Start difference. First operand 773 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,693 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2022-11-02 20:58:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:58:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:37,697 INFO L225 Difference]: With dead ends: 1161 [2022-11-02 20:58:37,697 INFO L226 Difference]: Without dead ends: 791 [2022-11-02 20:58:37,698 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:58:37,698 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:37,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:37,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-02 20:58:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2022-11-02 20:58:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2022-11-02 20:58:37,739 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2022-11-02 20:58:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:37,746 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2022-11-02 20:58:37,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2022-11-02 20:58:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:58:37,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:37,749 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] [2022-11-02 20:58:37,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:58:37,749 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:37,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2130964057, now seen corresponding path program 1 times [2022-11-02 20:58:37,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:37,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889602776] [2022-11-02 20:58:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,790 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:58:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:37,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889602776] [2022-11-02 20:58:37,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889602776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:37,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:37,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279003030] [2022-11-02 20:58:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:37,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:37,792 INFO L87 Difference]: Start difference. First operand 789 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,843 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2022-11-02 20:58:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:58:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:37,848 INFO L225 Difference]: With dead ends: 1353 [2022-11-02 20:58:37,848 INFO L226 Difference]: Without dead ends: 1351 [2022-11-02 20:58:37,850 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:58:37,851 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 23 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:37,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-11-02 20:58:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2022-11-02 20:58:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2022-11-02 20:58:37,888 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2022-11-02 20:58:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:37,888 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2022-11-02 20:58:37,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2022-11-02 20:58:37,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:58:37,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:37,890 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] [2022-11-02 20:58:37,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:58:37,890 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1462938661, now seen corresponding path program 1 times [2022-11-02 20:58:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:37,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779074298] [2022-11-02 20:58:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,938 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:58:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:37,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779074298] [2022-11-02 20:58:37,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779074298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:37,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:37,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326619335] [2022-11-02 20:58:37,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:37,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:37,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:37,941 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:37,995 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2022-11-02 20:58:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:58:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:38,001 INFO L225 Difference]: With dead ends: 2633 [2022-11-02 20:58:38,001 INFO L226 Difference]: Without dead ends: 1511 [2022-11-02 20:58:38,002 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:58:38,003 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:38,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2022-11-02 20:58:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2022-11-02 20:58:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2022-11-02 20:58:38,079 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2022-11-02 20:58:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:38,081 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2022-11-02 20:58:38,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2022-11-02 20:58:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:58:38,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:38,083 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] [2022-11-02 20:58:38,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:58:38,083 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1635592028, now seen corresponding path program 1 times [2022-11-02 20:58:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:38,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828451607] [2022-11-02 20:58:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:38,124 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:58:38,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:38,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828451607] [2022-11-02 20:58:38,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828451607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:38,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:38,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:38,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381788650] [2022-11-02 20:58:38,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:38,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:38,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:38,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:38,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:38,127 INFO L87 Difference]: Start difference. First operand 1509 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:38,177 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2022-11-02 20:58:38,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:38,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:58:38,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:38,182 INFO L225 Difference]: With dead ends: 2265 [2022-11-02 20:58:38,182 INFO L226 Difference]: Without dead ends: 1543 [2022-11-02 20:58:38,183 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:58:38,185 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:38,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-11-02 20:58:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2022-11-02 20:58:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2022-11-02 20:58:38,247 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2022-11-02 20:58:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:38,247 INFO L495 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2022-11-02 20:58:38,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2022-11-02 20:58:38,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:58:38,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:38,249 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] [2022-11-02 20:58:38,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:58:38,250 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:38,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1893757466, now seen corresponding path program 1 times [2022-11-02 20:58:38,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:38,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270162690] [2022-11-02 20:58:38,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:38,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:38,269 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:58:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:38,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270162690] [2022-11-02 20:58:38,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270162690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:38,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:38,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020023077] [2022-11-02 20:58:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:38,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:38,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:38,271 INFO L87 Difference]: Start difference. First operand 1541 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:38,370 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2022-11-02 20:58:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:38,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:58:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:38,378 INFO L225 Difference]: With dead ends: 2569 [2022-11-02 20:58:38,378 INFO L226 Difference]: Without dead ends: 2567 [2022-11-02 20:58:38,381 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:58:38,382 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:38,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:38,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2022-11-02 20:58:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2022-11-02 20:58:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2022-11-02 20:58:38,466 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2022-11-02 20:58:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:38,467 INFO L495 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2022-11-02 20:58:38,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2022-11-02 20:58:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:58:38,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:38,470 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] [2022-11-02 20:58:38,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:58:38,470 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1700145252, now seen corresponding path program 1 times [2022-11-02 20:58:38,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:38,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588848899] [2022-11-02 20:58:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:38,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:38,489 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:58:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:38,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588848899] [2022-11-02 20:58:38,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588848899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:38,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:38,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70005044] [2022-11-02 20:58:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:38,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:38,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:38,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:38,492 INFO L87 Difference]: Start difference. First operand 2309 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:38,576 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2022-11-02 20:58:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:58:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:38,585 INFO L225 Difference]: With dead ends: 5193 [2022-11-02 20:58:38,585 INFO L226 Difference]: Without dead ends: 2951 [2022-11-02 20:58:38,587 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:58:38,588 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:38,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-11-02 20:58:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2022-11-02 20:58:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2022-11-02 20:58:38,718 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2022-11-02 20:58:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:38,718 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2022-11-02 20:58:38,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2022-11-02 20:58:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:58:38,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:38,722 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] [2022-11-02 20:58:38,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:58:38,722 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1422844656, now seen corresponding path program 1 times [2022-11-02 20:58:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:38,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992790004] [2022-11-02 20:58:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:38,746 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:58:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:38,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992790004] [2022-11-02 20:58:38,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992790004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:38,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:38,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318527794] [2022-11-02 20:58:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:38,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:38,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:38,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:38,748 INFO L87 Difference]: Start difference. First operand 2949 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:38,846 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2022-11-02 20:58:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:58:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:38,855 INFO L225 Difference]: With dead ends: 4425 [2022-11-02 20:58:38,856 INFO L226 Difference]: Without dead ends: 3015 [2022-11-02 20:58:38,858 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:58:38,859 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:38,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2022-11-02 20:58:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2022-11-02 20:58:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2022-11-02 20:58:38,978 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2022-11-02 20:58:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:38,979 INFO L495 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2022-11-02 20:58:38,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2022-11-02 20:58:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:58:38,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:38,982 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] [2022-11-02 20:58:38,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:58:38,983 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1164679218, now seen corresponding path program 1 times [2022-11-02 20:58:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:38,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153167304] [2022-11-02 20:58:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:39,001 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:58:39,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:39,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153167304] [2022-11-02 20:58:39,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153167304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:39,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:39,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:39,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942243086] [2022-11-02 20:58:39,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:39,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:39,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:39,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:39,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:39,003 INFO L87 Difference]: Start difference. First operand 3013 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:39,132 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2022-11-02 20:58:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:39,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:58:39,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:39,146 INFO L225 Difference]: With dead ends: 4871 [2022-11-02 20:58:39,146 INFO L226 Difference]: Without dead ends: 4869 [2022-11-02 20:58:39,148 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:58:39,148 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:39,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2022-11-02 20:58:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2022-11-02 20:58:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2022-11-02 20:58:39,307 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2022-11-02 20:58:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:39,308 INFO L495 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2022-11-02 20:58:39,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2022-11-02 20:58:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:58:39,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:39,315 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] [2022-11-02 20:58:39,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:58:39,315 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:39,316 INFO L85 PathProgramCache]: Analyzing trace with hash -463614640, now seen corresponding path program 1 times [2022-11-02 20:58:39,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:39,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12865021] [2022-11-02 20:58:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:39,349 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:58:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:39,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12865021] [2022-11-02 20:58:39,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12865021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:39,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:39,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376545603] [2022-11-02 20:58:39,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:39,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:39,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:39,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:39,353 INFO L87 Difference]: Start difference. First operand 4613 states and 5443 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:39,527 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2022-11-02 20:58:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:39,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:58:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:39,528 INFO L225 Difference]: With dead ends: 10245 [2022-11-02 20:58:39,528 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:58:39,535 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:58:39,537 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:39,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:58:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:58:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:58:39,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-11-02 20:58:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:39,539 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:58:39,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:58:39,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:58:39,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:58:39,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:58:39,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:58:39,554 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-11-02 20:58:39,554 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-11-02 20:58:39,554 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,555 INFO L902 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-11-02 20:58:39,555 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:58:39,555 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:58:39,555 INFO L899 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,555 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,555 INFO L902 garLoopResultBuilder]: At program point L136(lines 6 137) the Hoare annotation is: true [2022-11-02 20:58:39,556 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-11-02 20:58:39,556 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2022-11-02 20:58:39,556 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,556 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-11-02 20:58:39,557 INFO L895 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-11-02 20:58:39,557 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,558 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,558 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-11-02 20:58:39,558 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,558 INFO L899 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,560 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-11-02 20:58:39,560 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:58:39,561 INFO L899 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-11-02 20:58:39,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2022-11-02 20:58:39,561 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,561 INFO L899 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,561 INFO L899 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,561 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:58:39,562 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-11-02 20:58:39,562 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,562 INFO L899 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-11-02 20:58:39,562 INFO L902 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-11-02 20:58:39,562 INFO L899 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,562 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2022-11-02 20:58:39,567 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:39,570 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:58:39,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:58:39 BoogieIcfgContainer [2022-11-02 20:58:39,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:58:39,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:58:39,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:58:39,584 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:58:39,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:35" (3/4) ... [2022-11-02 20:58:39,587 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:58:39,600 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-02 20:58:39,600 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:58:39,600 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:58:39,601 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:58:39,653 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:58:39,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:58:39,655 INFO L158 Benchmark]: Toolchain (without parser) took 4756.85ms. Allocated memory was 100.7MB in the beginning and 195.0MB in the end (delta: 94.4MB). Free memory was 59.8MB in the beginning and 75.0MB in the end (delta: -15.2MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,655 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:58:39,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.52ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 76.5MB in the end (delta: -16.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.81ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 74.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:58:39,656 INFO L158 Benchmark]: Boogie Preprocessor took 49.95ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,657 INFO L158 Benchmark]: RCFGBuilder took 346.01ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 60.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,657 INFO L158 Benchmark]: TraceAbstraction took 3890.81ms. Allocated memory was 100.7MB in the beginning and 195.0MB in the end (delta: 94.4MB). Free memory was 60.1MB in the beginning and 78.1MB in the end (delta: -18.1MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,657 INFO L158 Benchmark]: Witness Printer took 69.09ms. Allocated memory is still 195.0MB. Free memory was 78.1MB in the beginning and 75.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,666 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.52ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 76.5MB in the end (delta: -16.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.81ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 74.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.95ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.01ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 60.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3890.81ms. Allocated memory was 100.7MB in the beginning and 195.0MB in the end (delta: 94.4MB). Free memory was 60.1MB in the beginning and 78.1MB in the end (delta: -18.1MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. * Witness Printer took 69.09ms. Allocated memory is still 195.0MB. Free memory was 78.1MB in the beginning and 75.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 2438 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 964 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1474 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:58:39,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3613814-b4d9-42ee-a6db-c80a71abadc3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE