./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 2329fc70 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_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 12:52:57,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:52:57,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:52:57,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:52:57,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:52:57,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:52:57,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:52:57,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:52:57,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:52:57,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:52:57,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:52:57,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:52:57,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:52:57,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:52:57,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:52:57,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:52:57,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:52:57,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:52:57,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:52:57,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:52:57,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:52:57,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:52:57,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:52:57,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:52:57,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:52:57,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:52:57,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:52:57,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:52:57,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:52:57,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:52:57,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:52:57,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:52:57,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:52:57,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:52:57,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:52:57,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:52:57,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:52:57,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:52:57,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:52:57,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:52:57,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:52:57,481 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 12:52:57,497 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:52:57,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:52:57,497 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:52:57,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:52:57,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:52:57,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:52:57,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:52:57,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:52:57,498 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:52:57,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:52:57,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:52:57,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:52:57,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:52:57,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:52:57,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:52:57,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:52:57,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:52:57,499 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:52:57,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:52:57,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:52:57,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:52:57,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:52:57,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:52:57,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:52:57,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:52:57,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:52:57,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:52:57,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:52:57,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:52:57,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:52:57,501 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:52:57,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:52:57,501 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:52:57,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:52:57,501 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:52:57,502 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/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_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8 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-12-13 12:52:57,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:52:57,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:52:57,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:52:57,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:52:57,690 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:52:57,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_8.c [2022-12-13 12:53:00,231 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:53:00,378 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:53:00,378 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/sv-benchmarks/c/locks/test_locks_8.c [2022-12-13 12:53:00,385 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/data/36a4d824b/09043660fc2d41b3b43cca0d7c227b41/FLAG5b8f6574a [2022-12-13 12:53:00,799 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/data/36a4d824b/09043660fc2d41b3b43cca0d7c227b41 [2022-12-13 12:53:00,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:53:00,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:53:00,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:53:00,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:53:00,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:53:00,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:00,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a008d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00, skipping insertion in model container [2022-12-13 12:53:00,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:00,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:53:00,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:53:00,932 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-12-13 12:53:00,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:53:00,943 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:53:00,957 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-12-13 12:53:00,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:53:00,967 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:53:00,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00 WrapperNode [2022-12-13 12:53:00,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:53:00,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:53:00,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:53:00,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:53:00,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:00,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:00,991 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2022-12-13 12:53:00,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:53:00,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:53:00,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:53:00,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:53:00,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:00,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:00,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:00,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:01,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:01,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:01,005 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:01,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:01,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:53:01,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:53:01,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:53:01,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:53:01,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (1/1) ... [2022-12-13 12:53:01,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:53:01,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:53:01,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:53:01,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:53:01,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:53:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:53:01,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:53:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:53:01,117 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:53:01,118 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:53:01,242 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:53:01,246 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:53:01,246 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 12:53:01,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:01 BoogieIcfgContainer [2022-12-13 12:53:01,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:53:01,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:53:01,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:53:01,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:53:01,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:53:00" (1/3) ... [2022-12-13 12:53:01,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fe3c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:01, skipping insertion in model container [2022-12-13 12:53:01,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:00" (2/3) ... [2022-12-13 12:53:01,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fe3c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:01, skipping insertion in model container [2022-12-13 12:53:01,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:01" (3/3) ... [2022-12-13 12:53:01,256 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-12-13 12:53:01,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:53:01,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:53:01,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:53:01,319 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;@19ab696d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:53:01,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 12:53:01,322 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-12-13 12:53:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 12:53:01,327 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:01,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:01,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1577492323, now seen corresponding path program 1 times [2022-12-13 12:53:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:01,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89611096] [2022-12-13 12:53:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:01,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89611096] [2022-12-13 12:53:01,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89611096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:01,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:01,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:01,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171057093] [2022-12-13 12:53:01,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:01,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:01,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:01,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:01,544 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-12-13 12:53:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:01,582 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. [2022-12-13 12:53:01,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:01,585 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-12-13 12:53:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:01,593 INFO L225 Difference]: With dead ends: 71 [2022-12-13 12:53:01,593 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 12:53:01,595 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-12-13 12:53:01,598 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-12-13 12:53:01,599 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-12-13 12:53:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 12:53:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2022-12-13 12:53:01,621 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-12-13 12:53:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2022-12-13 12:53:01,623 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2022-12-13 12:53:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:01,623 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2022-12-13 12:53:01,623 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-12-13 12:53:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2022-12-13 12:53:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 12:53:01,624 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:01,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:01,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:53:01,624 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash -876427745, now seen corresponding path program 1 times [2022-12-13 12:53:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:01,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969558798] [2022-12-13 12:53:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:01,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969558798] [2022-12-13 12:53:01,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969558798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:01,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:01,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747109641] [2022-12-13 12:53:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:01,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:01,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:01,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:01,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:01,668 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-12-13 12:53:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:01,685 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2022-12-13 12:53:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:01,685 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-12-13 12:53:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:01,686 INFO L225 Difference]: With dead ends: 94 [2022-12-13 12:53:01,686 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 12:53:01,686 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-12-13 12:53:01,687 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-12-13 12:53:01,688 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-12-13 12:53:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 12:53:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-12-13 12:53:01,692 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-12-13 12:53:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-12-13 12:53:01,693 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2022-12-13 12:53:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:01,693 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-12-13 12:53:01,694 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-12-13 12:53:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-12-13 12:53:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 12:53:01,694 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:01,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:01,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:53:01,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1657407761, now seen corresponding path program 1 times [2022-12-13 12:53:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:01,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545361190] [2022-12-13 12:53:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545361190] [2022-12-13 12:53:01,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545361190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:01,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:01,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477264734] [2022-12-13 12:53:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:01,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:01,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:01,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:01,744 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-12-13 12:53:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:01,761 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2022-12-13 12:53:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:01,762 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-12-13 12:53:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:01,763 INFO L225 Difference]: With dead ends: 87 [2022-12-13 12:53:01,763 INFO L226 Difference]: Without dead ends: 60 [2022-12-13 12:53:01,763 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-12-13 12:53:01,765 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-12-13 12:53:01,765 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-12-13 12:53:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-13 12:53:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-12-13 12:53:01,770 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-12-13 12:53:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2022-12-13 12:53:01,771 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2022-12-13 12:53:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:01,771 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2022-12-13 12:53:01,771 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-12-13 12:53:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2022-12-13 12:53:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 12:53:01,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:01,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:01,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:53:01,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1399242323, now seen corresponding path program 1 times [2022-12-13 12:53:01,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:01,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809445095] [2022-12-13 12:53:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:01,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:01,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:01,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809445095] [2022-12-13 12:53:01,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809445095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:01,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:01,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640681607] [2022-12-13 12:53:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:01,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:01,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:01,812 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-12-13 12:53:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:01,827 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2022-12-13 12:53:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:01,828 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-12-13 12:53:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:01,829 INFO L225 Difference]: With dead ends: 109 [2022-12-13 12:53:01,829 INFO L226 Difference]: Without dead ends: 107 [2022-12-13 12:53:01,829 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-12-13 12:53:01,830 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-12-13 12:53:01,831 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-12-13 12:53:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-13 12:53:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2022-12-13 12:53:01,838 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-12-13 12:53:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2022-12-13 12:53:01,839 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 16 [2022-12-13 12:53:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:01,839 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2022-12-13 12:53:01,840 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-12-13 12:53:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2022-12-13 12:53:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 12:53:01,840 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:01,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:01,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:53:01,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:01,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash -698177745, now seen corresponding path program 1 times [2022-12-13 12:53:01,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:01,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460229860] [2022-12-13 12:53:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:01,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:01,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460229860] [2022-12-13 12:53:01,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460229860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:01,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:01,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927194934] [2022-12-13 12:53:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:01,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:01,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:01,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:01,874 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-12-13 12:53:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:01,888 INFO L93 Difference]: Finished difference Result 181 states and 315 transitions. [2022-12-13 12:53:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:01,889 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-12-13 12:53:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:01,890 INFO L225 Difference]: With dead ends: 181 [2022-12-13 12:53:01,890 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 12:53:01,890 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-12-13 12:53:01,891 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-12-13 12:53:01,892 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-12-13 12:53:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 12:53:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-12-13 12:53:01,897 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-12-13 12:53:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2022-12-13 12:53:01,898 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2022-12-13 12:53:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:01,898 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2022-12-13 12:53:01,898 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-12-13 12:53:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2022-12-13 12:53:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 12:53:01,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:01,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:01,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:53:01,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash -426624716, now seen corresponding path program 1 times [2022-12-13 12:53:01,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:01,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965696706] [2022-12-13 12:53:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:01,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:01,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:01,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965696706] [2022-12-13 12:53:01,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965696706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:01,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:01,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:01,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228323323] [2022-12-13 12:53:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:01,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:01,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:01,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:01,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:01,929 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-12-13 12:53:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:01,947 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2022-12-13 12:53:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:01,950 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-12-13 12:53:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:01,951 INFO L225 Difference]: With dead ends: 162 [2022-12-13 12:53:01,951 INFO L226 Difference]: Without dead ends: 111 [2022-12-13 12:53:01,952 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-12-13 12:53:01,953 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-12-13 12:53:01,953 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-12-13 12:53:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-13 12:53:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2022-12-13 12:53:01,961 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-12-13 12:53:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 183 transitions. [2022-12-13 12:53:01,963 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 183 transitions. Word has length 17 [2022-12-13 12:53:01,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:01,963 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 183 transitions. [2022-12-13 12:53:01,963 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-12-13 12:53:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 183 transitions. [2022-12-13 12:53:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 12:53:01,964 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:01,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:01,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:53:01,970 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:01,971 INFO L85 PathProgramCache]: Analyzing trace with hash -168459278, now seen corresponding path program 1 times [2022-12-13 12:53:01,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:01,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950117657] [2022-12-13 12:53:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:01,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:01,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950117657] [2022-12-13 12:53:01,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950117657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:01,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143909232] [2022-12-13 12:53:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,001 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-12-13 12:53:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,015 INFO L93 Difference]: Finished difference Result 309 states and 521 transitions. [2022-12-13 12:53:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,015 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-12-13 12:53:02,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,016 INFO L225 Difference]: With dead ends: 309 [2022-12-13 12:53:02,016 INFO L226 Difference]: Without dead ends: 207 [2022-12-13 12:53:02,017 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-12-13 12:53:02,018 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-12-13 12:53:02,019 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-12-13 12:53:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-12-13 12:53:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2022-12-13 12:53:02,030 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-12-13 12:53:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 339 transitions. [2022-12-13 12:53:02,032 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 339 transitions. Word has length 17 [2022-12-13 12:53:02,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,032 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 339 transitions. [2022-12-13 12:53:02,032 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-12-13 12:53:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2022-12-13 12:53:02,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 12:53:02,033 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:02,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:53:02,034 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,034 INFO L85 PathProgramCache]: Analyzing trace with hash -869523856, now seen corresponding path program 1 times [2022-12-13 12:53:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697087092] [2022-12-13 12:53:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697087092] [2022-12-13 12:53:02,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697087092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648771274] [2022-12-13 12:53:02,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,061 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-12-13 12:53:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,075 INFO L93 Difference]: Finished difference Result 257 states and 429 transitions. [2022-12-13 12:53:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,076 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-12-13 12:53:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,077 INFO L225 Difference]: With dead ends: 257 [2022-12-13 12:53:02,077 INFO L226 Difference]: Without dead ends: 255 [2022-12-13 12:53:02,077 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-12-13 12:53:02,078 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-12-13 12:53:02,079 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-12-13 12:53:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-12-13 12:53:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2022-12-13 12:53:02,088 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-12-13 12:53:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2022-12-13 12:53:02,089 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 17 [2022-12-13 12:53:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,090 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2022-12-13 12:53:02,090 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-12-13 12:53:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2022-12-13 12:53:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 12:53:02,091 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:02,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:53:02,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -927055644, now seen corresponding path program 1 times [2022-12-13 12:53:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908727728] [2022-12-13 12:53:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908727728] [2022-12-13 12:53:02,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908727728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097756202] [2022-12-13 12:53:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,116 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-12-13 12:53:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,131 INFO L93 Difference]: Finished difference Result 373 states and 617 transitions. [2022-12-13 12:53:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,132 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-12-13 12:53:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,134 INFO L225 Difference]: With dead ends: 373 [2022-12-13 12:53:02,134 INFO L226 Difference]: Without dead ends: 371 [2022-12-13 12:53:02,134 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-12-13 12:53:02,135 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-12-13 12:53:02,135 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-12-13 12:53:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-12-13 12:53:02,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 289. [2022-12-13 12:53:02,146 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-12-13 12:53:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 463 transitions. [2022-12-13 12:53:02,148 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 463 transitions. Word has length 18 [2022-12-13 12:53:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,148 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 463 transitions. [2022-12-13 12:53:02,148 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-12-13 12:53:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 463 transitions. [2022-12-13 12:53:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 12:53:02,150 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:53:02,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:53:02,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash -225991066, now seen corresponding path program 1 times [2022-12-13 12:53:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325657805] [2022-12-13 12:53:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325657805] [2022-12-13 12:53:02,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325657805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611755993] [2022-12-13 12:53:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,176 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-12-13 12:53:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,194 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2022-12-13 12:53:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,194 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-12-13 12:53:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,196 INFO L225 Difference]: With dead ends: 677 [2022-12-13 12:53:02,196 INFO L226 Difference]: Without dead ends: 395 [2022-12-13 12:53:02,197 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-12-13 12:53:02,198 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-12-13 12:53:02,198 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-12-13 12:53:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-12-13 12:53:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2022-12-13 12:53:02,207 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-12-13 12:53:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 619 transitions. [2022-12-13 12:53:02,208 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 619 transitions. Word has length 18 [2022-12-13 12:53:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,209 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 619 transitions. [2022-12-13 12:53:02,209 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-12-13 12:53:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 619 transitions. [2022-12-13 12:53:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 12:53:02,209 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,210 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-12-13 12:53:02,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:53:02,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1326261127, now seen corresponding path program 1 times [2022-12-13 12:53:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570367768] [2022-12-13 12:53:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570367768] [2022-12-13 12:53:02,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570367768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868511495] [2022-12-13 12:53:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,228 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-12-13 12:53:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,248 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2022-12-13 12:53:02,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,248 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-12-13 12:53:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,249 INFO L225 Difference]: With dead ends: 597 [2022-12-13 12:53:02,249 INFO L226 Difference]: Without dead ends: 407 [2022-12-13 12:53:02,250 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-12-13 12:53:02,250 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-12-13 12:53:02,250 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-12-13 12:53:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-12-13 12:53:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2022-12-13 12:53:02,260 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-12-13 12:53:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2022-12-13 12:53:02,265 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2022-12-13 12:53:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,265 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2022-12-13 12:53:02,265 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-12-13 12:53:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2022-12-13 12:53:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 12:53:02,266 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,267 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-12-13 12:53:02,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:53:02,267 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1584426565, now seen corresponding path program 1 times [2022-12-13 12:53:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170827773] [2022-12-13 12:53:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170827773] [2022-12-13 12:53:02,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170827773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990697227] [2022-12-13 12:53:02,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,288 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-12-13 12:53:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,305 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2022-12-13 12:53:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,305 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-12-13 12:53:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,307 INFO L225 Difference]: With dead ends: 713 [2022-12-13 12:53:02,307 INFO L226 Difference]: Without dead ends: 711 [2022-12-13 12:53:02,307 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-12-13 12:53:02,308 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-12-13 12:53:02,308 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-12-13 12:53:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-12-13 12:53:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2022-12-13 12:53:02,320 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-12-13 12:53:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2022-12-13 12:53:02,321 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2022-12-13 12:53:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,321 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2022-12-13 12:53:02,322 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-12-13 12:53:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2022-12-13 12:53:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 12:53:02,322 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,322 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-12-13 12:53:02,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:53:02,323 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2009476153, now seen corresponding path program 1 times [2022-12-13 12:53:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356992676] [2022-12-13 12:53:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356992676] [2022-12-13 12:53:02,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356992676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354986212] [2022-12-13 12:53:02,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,341 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-12-13 12:53:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,361 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2022-12-13 12:53:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,361 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-12-13 12:53:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,364 INFO L225 Difference]: With dead ends: 1337 [2022-12-13 12:53:02,364 INFO L226 Difference]: Without dead ends: 775 [2022-12-13 12:53:02,365 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-12-13 12:53:02,365 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-12-13 12:53:02,366 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-12-13 12:53:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-12-13 12:53:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2022-12-13 12:53:02,394 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-12-13 12:53:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2022-12-13 12:53:02,396 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2022-12-13 12:53:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,397 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2022-12-13 12:53:02,397 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-12-13 12:53:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2022-12-13 12:53:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 12:53:02,398 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,398 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-12-13 12:53:02,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:53:02,398 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1872798619, now seen corresponding path program 1 times [2022-12-13 12:53:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159948515] [2022-12-13 12:53:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159948515] [2022-12-13 12:53:02,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159948515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990743820] [2022-12-13 12:53:02,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,414 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-12-13 12:53:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,432 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2022-12-13 12:53:02,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,432 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-12-13 12:53:02,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,434 INFO L225 Difference]: With dead ends: 1161 [2022-12-13 12:53:02,434 INFO L226 Difference]: Without dead ends: 791 [2022-12-13 12:53:02,434 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-12-13 12:53:02,435 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-12-13 12:53:02,435 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-12-13 12:53:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-12-13 12:53:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2022-12-13 12:53:02,458 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-12-13 12:53:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2022-12-13 12:53:02,460 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2022-12-13 12:53:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,460 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2022-12-13 12:53:02,460 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-12-13 12:53:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2022-12-13 12:53:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 12:53:02,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,461 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-12-13 12:53:02,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:53:02,461 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2130964057, now seen corresponding path program 1 times [2022-12-13 12:53:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136158967] [2022-12-13 12:53:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136158967] [2022-12-13 12:53:02,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136158967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929058970] [2022-12-13 12:53:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,476 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-12-13 12:53:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,511 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2022-12-13 12:53:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,511 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-12-13 12:53:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,515 INFO L225 Difference]: With dead ends: 1353 [2022-12-13 12:53:02,516 INFO L226 Difference]: Without dead ends: 1351 [2022-12-13 12:53:02,516 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-12-13 12:53:02,517 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-12-13 12:53:02,517 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-12-13 12:53:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-12-13 12:53:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2022-12-13 12:53:02,552 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-12-13 12:53:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2022-12-13 12:53:02,556 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2022-12-13 12:53:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,556 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2022-12-13 12:53:02,556 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-12-13 12:53:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2022-12-13 12:53:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 12:53:02,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,558 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-12-13 12:53:02,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:53:02,558 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1462938661, now seen corresponding path program 1 times [2022-12-13 12:53:02,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979279089] [2022-12-13 12:53:02,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979279089] [2022-12-13 12:53:02,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979279089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648045224] [2022-12-13 12:53:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,579 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-12-13 12:53:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,622 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2022-12-13 12:53:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,623 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-12-13 12:53:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,627 INFO L225 Difference]: With dead ends: 2633 [2022-12-13 12:53:02,627 INFO L226 Difference]: Without dead ends: 1511 [2022-12-13 12:53:02,628 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-12-13 12:53:02,629 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-12-13 12:53:02,629 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-12-13 12:53:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2022-12-13 12:53:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2022-12-13 12:53:02,690 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-12-13 12:53:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2022-12-13 12:53:02,695 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2022-12-13 12:53:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,696 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2022-12-13 12:53:02,696 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-12-13 12:53:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2022-12-13 12:53:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 12:53:02,698 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,699 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-12-13 12:53:02,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:53:02,699 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1635592028, now seen corresponding path program 1 times [2022-12-13 12:53:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473945407] [2022-12-13 12:53:02,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473945407] [2022-12-13 12:53:02,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473945407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948490943] [2022-12-13 12:53:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,720 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-12-13 12:53:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,757 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2022-12-13 12:53:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,758 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-12-13 12:53:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,763 INFO L225 Difference]: With dead ends: 2265 [2022-12-13 12:53:02,763 INFO L226 Difference]: Without dead ends: 1543 [2022-12-13 12:53:02,764 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-12-13 12:53:02,764 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-12-13 12:53:02,765 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-12-13 12:53:02,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-12-13 12:53:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2022-12-13 12:53:02,795 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-12-13 12:53:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2022-12-13 12:53:02,797 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2022-12-13 12:53:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,797 INFO L495 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2022-12-13 12:53:02,798 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-12-13 12:53:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2022-12-13 12:53:02,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 12:53:02,799 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,799 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-12-13 12:53:02,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:53:02,799 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1893757466, now seen corresponding path program 1 times [2022-12-13 12:53:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573480763] [2022-12-13 12:53:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573480763] [2022-12-13 12:53:02,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573480763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479714521] [2022-12-13 12:53:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,814 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-12-13 12:53:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:02,853 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2022-12-13 12:53:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:02,854 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-12-13 12:53:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:02,861 INFO L225 Difference]: With dead ends: 2569 [2022-12-13 12:53:02,861 INFO L226 Difference]: Without dead ends: 2567 [2022-12-13 12:53:02,862 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-12-13 12:53:02,862 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-12-13 12:53:02,863 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-12-13 12:53:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2022-12-13 12:53:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2022-12-13 12:53:02,935 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-12-13 12:53:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2022-12-13 12:53:02,941 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2022-12-13 12:53:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:02,942 INFO L495 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2022-12-13 12:53:02,942 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-12-13 12:53:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2022-12-13 12:53:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 12:53:02,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:02,945 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-12-13 12:53:02,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:53:02,945 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1700145252, now seen corresponding path program 1 times [2022-12-13 12:53:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:02,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61542818] [2022-12-13 12:53:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:02,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61542818] [2022-12-13 12:53:02,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61542818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:02,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:02,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294586327] [2022-12-13 12:53:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:02,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:02,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:02,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:02,965 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-12-13 12:53:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:03,042 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2022-12-13 12:53:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:03,043 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-12-13 12:53:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:03,049 INFO L225 Difference]: With dead ends: 5193 [2022-12-13 12:53:03,049 INFO L226 Difference]: Without dead ends: 2951 [2022-12-13 12:53:03,051 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-12-13 12:53:03,051 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-12-13 12:53:03,051 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-12-13 12:53:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-12-13 12:53:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2022-12-13 12:53:03,136 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-12-13 12:53:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2022-12-13 12:53:03,141 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2022-12-13 12:53:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:03,141 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2022-12-13 12:53:03,141 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-12-13 12:53:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2022-12-13 12:53:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 12:53:03,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:03,143 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-12-13 12:53:03,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:53:03,143 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1422844656, now seen corresponding path program 1 times [2022-12-13 12:53:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:03,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230177128] [2022-12-13 12:53:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:03,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:03,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230177128] [2022-12-13 12:53:03,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230177128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:03,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:03,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:03,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928979604] [2022-12-13 12:53:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:03,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:03,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:03,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:03,157 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-12-13 12:53:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:03,229 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2022-12-13 12:53:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:03,230 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-12-13 12:53:03,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:03,238 INFO L225 Difference]: With dead ends: 4425 [2022-12-13 12:53:03,238 INFO L226 Difference]: Without dead ends: 3015 [2022-12-13 12:53:03,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:03,241 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-12-13 12:53:03,241 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-12-13 12:53:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2022-12-13 12:53:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2022-12-13 12:53:03,338 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-12-13 12:53:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2022-12-13 12:53:03,348 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2022-12-13 12:53:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:03,349 INFO L495 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2022-12-13 12:53:03,349 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-12-13 12:53:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2022-12-13 12:53:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 12:53:03,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:03,352 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-12-13 12:53:03,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 12:53:03,352 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:03,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1164679218, now seen corresponding path program 1 times [2022-12-13 12:53:03,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:03,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578371636] [2022-12-13 12:53:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:03,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:03,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578371636] [2022-12-13 12:53:03,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578371636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:03,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:03,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:03,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647009098] [2022-12-13 12:53:03,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:03,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:03,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:03,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:03,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:03,372 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-12-13 12:53:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:03,464 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2022-12-13 12:53:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:03,464 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-12-13 12:53:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:03,477 INFO L225 Difference]: With dead ends: 4871 [2022-12-13 12:53:03,477 INFO L226 Difference]: Without dead ends: 4869 [2022-12-13 12:53:03,478 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-12-13 12:53:03,479 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-12-13 12:53:03,479 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-12-13 12:53:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2022-12-13 12:53:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2022-12-13 12:53:03,565 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-12-13 12:53:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2022-12-13 12:53:03,574 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2022-12-13 12:53:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:03,574 INFO L495 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2022-12-13 12:53:03,574 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-12-13 12:53:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2022-12-13 12:53:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 12:53:03,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:53:03,578 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-12-13 12:53:03,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 12:53:03,578 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:53:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:53:03,578 INFO L85 PathProgramCache]: Analyzing trace with hash -463614640, now seen corresponding path program 1 times [2022-12-13 12:53:03,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:53:03,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902857607] [2022-12-13 12:53:03,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:53:03,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:53:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:53:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:53:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:53:03,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902857607] [2022-12-13 12:53:03,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902857607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:53:03,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:53:03,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:53:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803988653] [2022-12-13 12:53:03,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:53:03,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:53:03,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:53:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:53:03,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:53:03,592 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-12-13 12:53:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:53:03,744 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2022-12-13 12:53:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:53:03,745 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-12-13 12:53:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:53:03,745 INFO L225 Difference]: With dead ends: 10245 [2022-12-13 12:53:03,745 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 12:53:03,753 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-12-13 12:53:03,754 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-12-13 12:53:03,754 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-12-13 12:53:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 12:53:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 12:53:03,755 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-12-13 12:53:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 12:53:03,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-12-13 12:53:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:53:03,755 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:53:03,756 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-12-13 12:53:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 12:53:03,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 12:53:03,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 12:53:03,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 12:53:03,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 12:53:03,770 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-12-13 12:53:03,771 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-12-13 12:53:03,771 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 6 137) the Hoare annotation is: true [2022-12-13 12:53:03,771 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,771 INFO L902 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-12-13 12:53:03,771 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 12:53:03,771 INFO L899 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,771 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,771 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,772 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-12-13 12:53:03,773 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 12:53:03,773 INFO L899 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-12-13 12:53:03,773 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2022-12-13 12:53:03,773 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,773 INFO L899 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,773 INFO L899 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,773 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,773 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 12:53:03,774 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-12-13 12:53:03,774 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,774 INFO L899 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-12-13 12:53:03,774 INFO L902 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-12-13 12:53:03,774 INFO L899 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,774 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 7 137) the Hoare annotation is: false [2022-12-13 12:53:03,774 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2022-12-13 12:53:03,777 INFO L445 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-12-13 12:53:03,779 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:53:03,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:53:03 BoogieIcfgContainer [2022-12-13 12:53:03,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:53:03,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:53:03,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:53:03,788 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:53:03,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:01" (3/4) ... [2022-12-13 12:53:03,792 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 12:53:03,802 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-13 12:53:03,802 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 12:53:03,802 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 12:53:03,802 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 12:53:03,838 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:53:03,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:53:03,838 INFO L158 Benchmark]: Toolchain (without parser) took 3035.67ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 92.3MB in the beginning and 108.9MB in the end (delta: -16.5MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-12-13 12:53:03,839 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:53:03,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.80ms. Allocated memory is still 125.8MB. Free memory was 92.3MB in the beginning and 81.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 12:53:03,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.30ms. Allocated memory is still 125.8MB. Free memory was 81.6MB in the beginning and 79.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:53:03,839 INFO L158 Benchmark]: Boogie Preprocessor took 15.16ms. Allocated memory is still 125.8MB. Free memory was 79.9MB in the beginning and 78.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:53:03,840 INFO L158 Benchmark]: RCFGBuilder took 240.48ms. Allocated memory is still 125.8MB. Free memory was 78.6MB in the beginning and 66.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 12:53:03,840 INFO L158 Benchmark]: TraceAbstraction took 2537.73ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 65.6MB in the beginning and 112.0MB in the end (delta: -46.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-12-13 12:53:03,840 INFO L158 Benchmark]: Witness Printer took 49.96ms. Allocated memory is still 182.5MB. Free memory was 112.0MB in the beginning and 108.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:53:03,842 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.11ms. Allocated memory is still 104.9MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.80ms. Allocated memory is still 125.8MB. Free memory was 92.3MB in the beginning and 81.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.30ms. Allocated memory is still 125.8MB. Free memory was 81.6MB in the beginning and 79.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.16ms. Allocated memory is still 125.8MB. Free memory was 79.9MB in the beginning and 78.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 240.48ms. Allocated memory is still 125.8MB. Free memory was 78.6MB in the beginning and 66.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2537.73ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 65.6MB in the beginning and 112.0MB in the end (delta: -46.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Witness Printer took 49.96ms. Allocated memory is still 182.5MB. Free memory was 112.0MB in the beginning and 108.9MB 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: 2.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 2438 SdHoareTripleChecker+Invalid, 0.1s 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.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s 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.1s SatisfiabilityAnalysisTime, 0.4s 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: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-12-13 12:53:03,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644aa177-94e9-4375-a181-c4a24a891138/bin/uautomizer-uyxdKDjOR8/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