./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/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_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/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_6a68d259-cdd9-4b8e-934f-a5e04a679e25/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 1936862b5856707e80b1aa2b38aa8e033b3615fe51a16f40b8e11843db1147ca --- 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 20:55:54,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:55:54,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:55:54,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:55:54,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:55:54,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:55:54,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:55:54,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:55:54,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:55:54,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:55:54,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:55:54,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:55:54,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:55:54,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:55:54,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:55:54,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:55:54,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:55:54,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:55:54,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:55:54,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:55:54,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:55:54,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:55:54,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:55:54,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:55:54,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:55:54,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:55:54,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:55:54,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:55:54,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:55:54,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:55:54,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:55:54,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:55:54,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:55:54,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:55:54,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:55:54,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:55:54,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:55:54,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:55:54,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:55:54,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:55:54,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:55:54,665 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:55:54,692 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:55:54,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:55:54,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:55:54,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:55:54,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:55:54,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:55:54,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:55:54,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:55:54,711 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:55:54,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:55:54,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:55:54,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:55:54,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:55:54,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:55:54,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:55:54,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:55:54,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:55:54,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:55:54,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:55:54,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:55:54,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:55:54,714 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:55:54,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:55:54,714 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:55:54,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:55:54,714 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:55:54,714 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_6a68d259-cdd9-4b8e-934f-a5e04a679e25/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_6a68d259-cdd9-4b8e-934f-a5e04a679e25/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 -> 1936862b5856707e80b1aa2b38aa8e033b3615fe51a16f40b8e11843db1147ca [2022-12-13 20:55:54,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:55:54,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:55:54,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:55:54,893 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:55:54,893 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:55:54,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2022-12-13 20:55:57,481 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:55:57,714 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:55:57,715 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2022-12-13 20:55:57,724 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/data/ac76418c4/9aab8eb9064e4d5a8369bf4a299ce20c/FLAGb15df4767 [2022-12-13 20:55:57,736 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/data/ac76418c4/9aab8eb9064e4d5a8369bf4a299ce20c [2022-12-13 20:55:57,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:55:57,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:55:57,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:55:57,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:55:57,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:55:57,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:55:57" (1/1) ... [2022-12-13 20:55:57,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4659105e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:57, skipping insertion in model container [2022-12-13 20:55:57,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:55:57" (1/1) ... [2022-12-13 20:55:57,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:55:57,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:55:57,971 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_6a68d259-cdd9-4b8e-934f-a5e04a679e25/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c[30998,31011] [2022-12-13 20:55:57,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:55:57,983 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:55:58,037 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_6a68d259-cdd9-4b8e-934f-a5e04a679e25/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c[30998,31011] [2022-12-13 20:55:58,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:55:58,048 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:55:58,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58 WrapperNode [2022-12-13 20:55:58,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:55:58,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:55:58,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:55:58,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:55:58,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,112 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 959 [2022-12-13 20:55:58,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:55:58,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:55:58,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:55:58,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:55:58,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,143 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:55:58,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:55:58,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:55:58,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:55:58,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (1/1) ... [2022-12-13 20:55:58,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:55:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:55:58,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:55:58,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a68d259-cdd9-4b8e-934f-a5e04a679e25/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:55:58,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:55:58,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:55:58,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:55:58,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:55:58,323 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:55:58,325 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:55:59,048 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:55:59,058 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:55:59,058 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 20:55:59,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:55:59 BoogieIcfgContainer [2022-12-13 20:55:59,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:55:59,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:55:59,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:55:59,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:55:59,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:55:57" (1/3) ... [2022-12-13 20:55:59,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c81d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:55:59, skipping insertion in model container [2022-12-13 20:55:59,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:58" (2/3) ... [2022-12-13 20:55:59,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c81d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:55:59, skipping insertion in model container [2022-12-13 20:55:59,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:55:59" (3/3) ... [2022-12-13 20:55:59,070 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2022-12-13 20:55:59,089 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:55:59,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:55:59,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:55:59,139 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;@cc7ddd2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:55:59,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:55:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 300 states, 298 states have (on average 1.832214765100671) internal successors, (546), 299 states have internal predecessors, (546), 0 states have call successors, (0), 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 20:55:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 20:55:59,152 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:55:59,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:59,153 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:55:59,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1955462636, now seen corresponding path program 1 times [2022-12-13 20:55:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:59,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56828518] [2022-12-13 20:55:59,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:59,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:59,407 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 20:55:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:59,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56828518] [2022-12-13 20:55:59,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56828518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:59,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:59,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:55:59,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758351490] [2022-12-13 20:55:59,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:59,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 20:55:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:59,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 20:55:59,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 20:55:59,449 INFO L87 Difference]: Start difference. First operand has 300 states, 298 states have (on average 1.832214765100671) internal successors, (546), 299 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:55:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:55:59,482 INFO L93 Difference]: Finished difference Result 405 states and 730 transitions. [2022-12-13 20:55:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 20:55:59,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-12-13 20:55:59,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:55:59,492 INFO L225 Difference]: With dead ends: 405 [2022-12-13 20:55:59,492 INFO L226 Difference]: Without dead ends: 296 [2022-12-13 20:55:59,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 20:55:59,497 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:55:59,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:55:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-12-13 20:55:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-12-13 20:55:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.8271186440677967) internal successors, (539), 295 states have internal predecessors, (539), 0 states have call successors, (0), 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 20:55:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 539 transitions. [2022-12-13 20:55:59,535 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 539 transitions. Word has length 77 [2022-12-13 20:55:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:55:59,536 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 539 transitions. [2022-12-13 20:55:59,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:55:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 539 transitions. [2022-12-13 20:55:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 20:55:59,538 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:55:59,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:59,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:55:59,539 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:55:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:59,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2089476142, now seen corresponding path program 1 times [2022-12-13 20:55:59,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:59,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201515663] [2022-12-13 20:55:59,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:59,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:59,767 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 20:55:59,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:59,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201515663] [2022-12-13 20:55:59,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201515663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:59,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:59,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:55:59,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723020719] [2022-12-13 20:55:59,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:59,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:55:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:59,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:55:59,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:55:59,770 INFO L87 Difference]: Start difference. First operand 296 states and 539 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:55:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:55:59,871 INFO L93 Difference]: Finished difference Result 400 states and 720 transitions. [2022-12-13 20:55:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:55:59,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-12-13 20:55:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:55:59,874 INFO L225 Difference]: With dead ends: 400 [2022-12-13 20:55:59,874 INFO L226 Difference]: Without dead ends: 296 [2022-12-13 20:55:59,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:55:59,876 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 3 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:55:59,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2099 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:55:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-12-13 20:55:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-12-13 20:55:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.6711864406779662) internal successors, (493), 295 states have internal predecessors, (493), 0 states have call successors, (0), 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 20:55:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 493 transitions. [2022-12-13 20:55:59,894 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 493 transitions. Word has length 77 [2022-12-13 20:55:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:55:59,894 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 493 transitions. [2022-12-13 20:55:59,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:55:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 493 transitions. [2022-12-13 20:55:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-13 20:55:59,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:55:59,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:59,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:55:59,899 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:55:59,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1985083144, now seen corresponding path program 1 times [2022-12-13 20:55:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:59,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687552144] [2022-12-13 20:55:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:00,023 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 20:56:00,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:00,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687552144] [2022-12-13 20:56:00,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687552144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:00,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:00,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854315236] [2022-12-13 20:56:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:00,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:00,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:00,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:00,026 INFO L87 Difference]: Start difference. First operand 296 states and 493 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:00,059 INFO L93 Difference]: Finished difference Result 484 states and 825 transitions. [2022-12-13 20:56:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:00,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-12-13 20:56:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:00,063 INFO L225 Difference]: With dead ends: 484 [2022-12-13 20:56:00,063 INFO L226 Difference]: Without dead ends: 384 [2022-12-13 20:56:00,064 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 20:56:00,065 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 147 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:00,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 926 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-12-13 20:56:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2022-12-13 20:56:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.68503937007874) internal successors, (642), 381 states have internal predecessors, (642), 0 states have call successors, (0), 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 20:56:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 642 transitions. [2022-12-13 20:56:00,075 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 642 transitions. Word has length 122 [2022-12-13 20:56:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:00,076 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 642 transitions. [2022-12-13 20:56:00,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 642 transitions. [2022-12-13 20:56:00,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 20:56:00,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:00,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:00,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:56:00,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:00,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash -387323276, now seen corresponding path program 1 times [2022-12-13 20:56:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:00,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945216193] [2022-12-13 20:56:00,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:00,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:00,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:00,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945216193] [2022-12-13 20:56:00,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945216193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:00,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:00,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:00,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721379469] [2022-12-13 20:56:00,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:00,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:00,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:00,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:00,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:00,175 INFO L87 Difference]: Start difference. First operand 382 states and 642 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:00,198 INFO L93 Difference]: Finished difference Result 734 states and 1258 transitions. [2022-12-13 20:56:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-12-13 20:56:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:00,201 INFO L225 Difference]: With dead ends: 734 [2022-12-13 20:56:00,201 INFO L226 Difference]: Without dead ends: 548 [2022-12-13 20:56:00,201 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 20:56:00,202 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 148 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:00,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 938 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-12-13 20:56:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2022-12-13 20:56:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.7045871559633028) internal successors, (929), 545 states have internal predecessors, (929), 0 states have call successors, (0), 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 20:56:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 929 transitions. [2022-12-13 20:56:00,215 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 929 transitions. Word has length 125 [2022-12-13 20:56:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:00,215 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 929 transitions. [2022-12-13 20:56:00,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 929 transitions. [2022-12-13 20:56:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-13 20:56:00,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:00,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:00,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:56:00,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:00,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash 274346619, now seen corresponding path program 1 times [2022-12-13 20:56:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:00,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322474376] [2022-12-13 20:56:00,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:00,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:00,300 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 20:56:00,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:00,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322474376] [2022-12-13 20:56:00,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322474376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:00,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:00,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:00,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139156529] [2022-12-13 20:56:00,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:00,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:00,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:00,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:00,303 INFO L87 Difference]: Start difference. First operand 546 states and 929 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:00,330 INFO L93 Difference]: Finished difference Result 1206 states and 2083 transitions. [2022-12-13 20:56:00,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:00,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-12-13 20:56:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:00,334 INFO L225 Difference]: With dead ends: 1206 [2022-12-13 20:56:00,335 INFO L226 Difference]: Without dead ends: 856 [2022-12-13 20:56:00,335 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 20:56:00,336 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 141 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:00,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 939 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-12-13 20:56:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 854. [2022-12-13 20:56:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 1.7174677608440798) internal successors, (1465), 853 states have internal predecessors, (1465), 0 states have call successors, (0), 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 20:56:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1465 transitions. [2022-12-13 20:56:00,354 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1465 transitions. Word has length 128 [2022-12-13 20:56:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:00,355 INFO L495 AbstractCegarLoop]: Abstraction has 854 states and 1465 transitions. [2022-12-13 20:56:00,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1465 transitions. [2022-12-13 20:56:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-13 20:56:00,356 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:00,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:00,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:56:00,357 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:00,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1678930553, now seen corresponding path program 1 times [2022-12-13 20:56:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:00,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977519266] [2022-12-13 20:56:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:00,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:00,434 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 20:56:00,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:00,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977519266] [2022-12-13 20:56:00,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977519266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:00,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:00,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303728210] [2022-12-13 20:56:00,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:00,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:00,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:00,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:00,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:00,436 INFO L87 Difference]: Start difference. First operand 854 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:00,467 INFO L93 Difference]: Finished difference Result 2090 states and 3619 transitions. [2022-12-13 20:56:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:00,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-12-13 20:56:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:00,471 INFO L225 Difference]: With dead ends: 2090 [2022-12-13 20:56:00,471 INFO L226 Difference]: Without dead ends: 1432 [2022-12-13 20:56:00,472 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 20:56:00,473 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 134 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:00,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 940 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-12-13 20:56:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1430. [2022-12-13 20:56:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1429 states have (on average 1.722183344996501) internal successors, (2461), 1429 states have internal predecessors, (2461), 0 states have call successors, (0), 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 20:56:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2461 transitions. [2022-12-13 20:56:00,502 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2461 transitions. Word has length 131 [2022-12-13 20:56:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:00,502 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 2461 transitions. [2022-12-13 20:56:00,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2461 transitions. [2022-12-13 20:56:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 20:56:00,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:00,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:00,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:56:00,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:00,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash -904041234, now seen corresponding path program 1 times [2022-12-13 20:56:00,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:00,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294454420] [2022-12-13 20:56:00,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:00,634 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 20:56:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:00,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294454420] [2022-12-13 20:56:00,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294454420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:00,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:00,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:56:00,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816649312] [2022-12-13 20:56:00,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:00,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:56:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:00,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:56:00,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:56:00,637 INFO L87 Difference]: Start difference. First operand 1430 states and 2461 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:00,930 INFO L93 Difference]: Finished difference Result 7238 states and 12653 transitions. [2022-12-13 20:56:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:56:00,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-12-13 20:56:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:00,944 INFO L225 Difference]: With dead ends: 7238 [2022-12-13 20:56:00,944 INFO L226 Difference]: Without dead ends: 6004 [2022-12-13 20:56:00,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:56:00,947 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 1397 mSDsluCounter, 3354 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:00,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 3839 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:56:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2022-12-13 20:56:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 2578. [2022-12-13 20:56:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2577 states have (on average 1.7283663174233606) internal successors, (4454), 2577 states have internal predecessors, (4454), 0 states have call successors, (0), 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 20:56:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 4454 transitions. [2022-12-13 20:56:01,058 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 4454 transitions. Word has length 134 [2022-12-13 20:56:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:01,058 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 4454 transitions. [2022-12-13 20:56:01,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 4454 transitions. [2022-12-13 20:56:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 20:56:01,060 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:01,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:01,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:56:01,060 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash -55113831, now seen corresponding path program 1 times [2022-12-13 20:56:01,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:01,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068836783] [2022-12-13 20:56:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:01,152 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 20:56:01,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:01,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068836783] [2022-12-13 20:56:01,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068836783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:01,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:01,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:01,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624038946] [2022-12-13 20:56:01,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:01,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:01,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:01,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:01,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:01,154 INFO L87 Difference]: Start difference. First operand 2578 states and 4454 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:01,356 INFO L93 Difference]: Finished difference Result 7484 states and 13044 transitions. [2022-12-13 20:56:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:56:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2022-12-13 20:56:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:01,366 INFO L225 Difference]: With dead ends: 7484 [2022-12-13 20:56:01,366 INFO L226 Difference]: Without dead ends: 5102 [2022-12-13 20:56:01,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:01,370 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 510 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:01,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1451 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2022-12-13 20:56:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 3823. [2022-12-13 20:56:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3823 states, 3822 states have (on average 1.7318158032443747) internal successors, (6619), 3822 states have internal predecessors, (6619), 0 states have call successors, (0), 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 20:56:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 6619 transitions. [2022-12-13 20:56:01,488 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 6619 transitions. Word has length 135 [2022-12-13 20:56:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:01,489 INFO L495 AbstractCegarLoop]: Abstraction has 3823 states and 6619 transitions. [2022-12-13 20:56:01,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 6619 transitions. [2022-12-13 20:56:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 20:56:01,491 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:01,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:01,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:56:01,492 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:01,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash -979745861, now seen corresponding path program 1 times [2022-12-13 20:56:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:01,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882743085] [2022-12-13 20:56:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:01,569 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 20:56:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:01,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882743085] [2022-12-13 20:56:01,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882743085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:01,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:01,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:01,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961436693] [2022-12-13 20:56:01,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:01,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:01,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:01,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:01,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:01,571 INFO L87 Difference]: Start difference. First operand 3823 states and 6619 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:01,759 INFO L93 Difference]: Finished difference Result 7409 states and 12838 transitions. [2022-12-13 20:56:01,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:01,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-12-13 20:56:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:01,771 INFO L225 Difference]: With dead ends: 7409 [2022-12-13 20:56:01,771 INFO L226 Difference]: Without dead ends: 5415 [2022-12-13 20:56:01,773 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 20:56:01,774 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 149 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:01,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1060 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2022-12-13 20:56:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 5413. [2022-12-13 20:56:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5413 states, 5412 states have (on average 1.7235772357723578) internal successors, (9328), 5412 states have internal predecessors, (9328), 0 states have call successors, (0), 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 20:56:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 9328 transitions. [2022-12-13 20:56:01,948 INFO L78 Accepts]: Start accepts. Automaton has 5413 states and 9328 transitions. Word has length 136 [2022-12-13 20:56:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:01,948 INFO L495 AbstractCegarLoop]: Abstraction has 5413 states and 9328 transitions. [2022-12-13 20:56:01,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5413 states and 9328 transitions. [2022-12-13 20:56:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 20:56:01,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:01,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:01,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:56:01,950 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:01,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash -993525919, now seen corresponding path program 1 times [2022-12-13 20:56:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:01,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767377515] [2022-12-13 20:56:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:02,018 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 20:56:02,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:02,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767377515] [2022-12-13 20:56:02,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767377515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:02,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:02,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:02,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4842733] [2022-12-13 20:56:02,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:02,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:02,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:02,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:02,020 INFO L87 Difference]: Start difference. First operand 5413 states and 9328 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:02,242 INFO L93 Difference]: Finished difference Result 10473 states and 18062 transitions. [2022-12-13 20:56:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:02,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-12-13 20:56:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:02,267 INFO L225 Difference]: With dead ends: 10473 [2022-12-13 20:56:02,267 INFO L226 Difference]: Without dead ends: 7639 [2022-12-13 20:56:02,271 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 20:56:02,272 INFO L413 NwaCegarLoop]: 582 mSDtfsCounter, 142 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:02,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1045 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2022-12-13 20:56:02,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 7637. [2022-12-13 20:56:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7637 states, 7636 states have (on average 1.714772132006286) internal successors, (13094), 7636 states have internal predecessors, (13094), 0 states have call successors, (0), 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 20:56:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7637 states to 7637 states and 13094 transitions. [2022-12-13 20:56:02,586 INFO L78 Accepts]: Start accepts. Automaton has 7637 states and 13094 transitions. Word has length 136 [2022-12-13 20:56:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:02,587 INFO L495 AbstractCegarLoop]: Abstraction has 7637 states and 13094 transitions. [2022-12-13 20:56:02,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 7637 states and 13094 transitions. [2022-12-13 20:56:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 20:56:02,589 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:02,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:02,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:56:02,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1484688773, now seen corresponding path program 1 times [2022-12-13 20:56:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:02,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512658296] [2022-12-13 20:56:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:02,667 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 20:56:02,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:02,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512658296] [2022-12-13 20:56:02,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512658296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:02,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:02,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:02,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495953198] [2022-12-13 20:56:02,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:02,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:02,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:02,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:02,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:02,669 INFO L87 Difference]: Start difference. First operand 7637 states and 13094 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:03,081 INFO L93 Difference]: Finished difference Result 14737 states and 25278 transitions. [2022-12-13 20:56:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:03,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-12-13 20:56:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:03,107 INFO L225 Difference]: With dead ends: 14737 [2022-12-13 20:56:03,107 INFO L226 Difference]: Without dead ends: 10721 [2022-12-13 20:56:03,113 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 20:56:03,114 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 135 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:03,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1030 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10721 states. [2022-12-13 20:56:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10721 to 10719. [2022-12-13 20:56:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10719 states, 10718 states have (on average 1.70460906885613) internal successors, (18270), 10718 states have internal predecessors, (18270), 0 states have call successors, (0), 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 20:56:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10719 states to 10719 states and 18270 transitions. [2022-12-13 20:56:03,601 INFO L78 Accepts]: Start accepts. Automaton has 10719 states and 18270 transitions. Word has length 136 [2022-12-13 20:56:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:03,601 INFO L495 AbstractCegarLoop]: Abstraction has 10719 states and 18270 transitions. [2022-12-13 20:56:03,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 10719 states and 18270 transitions. [2022-12-13 20:56:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 20:56:03,603 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:03,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:03,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:56:03,604 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash 660836229, now seen corresponding path program 1 times [2022-12-13 20:56:03,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:03,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699416527] [2022-12-13 20:56:03,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:03,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:03,729 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 20:56:03,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:03,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699416527] [2022-12-13 20:56:03,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699416527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:03,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:03,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:03,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630868237] [2022-12-13 20:56:03,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:03,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:03,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:03,731 INFO L87 Difference]: Start difference. First operand 10719 states and 18270 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:04,445 INFO L93 Difference]: Finished difference Result 34764 states and 59349 transitions. [2022-12-13 20:56:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:56:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-12-13 20:56:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:04,486 INFO L225 Difference]: With dead ends: 34764 [2022-12-13 20:56:04,486 INFO L226 Difference]: Without dead ends: 24351 [2022-12-13 20:56:04,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:04,498 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 509 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:04,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1569 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24351 states. [2022-12-13 20:56:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24351 to 17481. [2022-12-13 20:56:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17481 states, 17480 states have (on average 1.6966819221967964) internal successors, (29658), 17480 states have internal predecessors, (29658), 0 states have call successors, (0), 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 20:56:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17481 states to 17481 states and 29658 transitions. [2022-12-13 20:56:05,023 INFO L78 Accepts]: Start accepts. Automaton has 17481 states and 29658 transitions. Word has length 136 [2022-12-13 20:56:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:05,023 INFO L495 AbstractCegarLoop]: Abstraction has 17481 states and 29658 transitions. [2022-12-13 20:56:05,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 17481 states and 29658 transitions. [2022-12-13 20:56:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 20:56:05,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:05,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:05,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:56:05,025 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:05,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1010634531, now seen corresponding path program 1 times [2022-12-13 20:56:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:05,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010233059] [2022-12-13 20:56:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:05,079 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 20:56:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:05,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010233059] [2022-12-13 20:56:05,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010233059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:05,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:05,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776853078] [2022-12-13 20:56:05,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:05,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:05,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:05,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:05,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:05,081 INFO L87 Difference]: Start difference. First operand 17481 states and 29658 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:05,807 INFO L93 Difference]: Finished difference Result 38978 states and 66415 transitions. [2022-12-13 20:56:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:05,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-12-13 20:56:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:05,836 INFO L225 Difference]: With dead ends: 38978 [2022-12-13 20:56:05,836 INFO L226 Difference]: Without dead ends: 26602 [2022-12-13 20:56:05,847 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 20:56:05,848 INFO L413 NwaCegarLoop]: 624 mSDtfsCounter, 156 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:05,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1085 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26602 states. [2022-12-13 20:56:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26602 to 26600. [2022-12-13 20:56:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26600 states, 26599 states have (on average 1.6881085755103575) internal successors, (44902), 26599 states have internal predecessors, (44902), 0 states have call successors, (0), 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 20:56:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26600 states to 26600 states and 44902 transitions. [2022-12-13 20:56:06,610 INFO L78 Accepts]: Start accepts. Automaton has 26600 states and 44902 transitions. Word has length 136 [2022-12-13 20:56:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:06,610 INFO L495 AbstractCegarLoop]: Abstraction has 26600 states and 44902 transitions. [2022-12-13 20:56:06,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 26600 states and 44902 transitions. [2022-12-13 20:56:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 20:56:06,611 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:06,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:06,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:56:06,612 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:06,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:06,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1549455952, now seen corresponding path program 1 times [2022-12-13 20:56:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:06,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084989184] [2022-12-13 20:56:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:06,714 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 20:56:06,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084989184] [2022-12-13 20:56:06,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084989184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:06,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:06,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:06,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344995487] [2022-12-13 20:56:06,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:06,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:06,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:06,716 INFO L87 Difference]: Start difference. First operand 26600 states and 44902 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:08,456 INFO L93 Difference]: Finished difference Result 86940 states and 146868 transitions. [2022-12-13 20:56:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:56:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-12-13 20:56:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:08,529 INFO L225 Difference]: With dead ends: 86940 [2022-12-13 20:56:08,529 INFO L226 Difference]: Without dead ends: 60568 [2022-12-13 20:56:08,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:08,551 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 507 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:08,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1571 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60568 states. [2022-12-13 20:56:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60568 to 43441. [2022-12-13 20:56:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43441 states, 43440 states have (on average 1.6784300184162062) internal successors, (72911), 43440 states have internal predecessors, (72911), 0 states have call successors, (0), 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 20:56:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43441 states to 43441 states and 72911 transitions. [2022-12-13 20:56:09,915 INFO L78 Accepts]: Start accepts. Automaton has 43441 states and 72911 transitions. Word has length 137 [2022-12-13 20:56:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:09,915 INFO L495 AbstractCegarLoop]: Abstraction has 43441 states and 72911 transitions. [2022-12-13 20:56:09,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 43441 states and 72911 transitions. [2022-12-13 20:56:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 20:56:09,916 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:09,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:09,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:56:09,917 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:09,917 INFO L85 PathProgramCache]: Analyzing trace with hash -799099364, now seen corresponding path program 1 times [2022-12-13 20:56:09,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:09,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026647534] [2022-12-13 20:56:09,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:09,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:09,987 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 20:56:09,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:09,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026647534] [2022-12-13 20:56:09,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026647534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:09,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:09,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260105878] [2022-12-13 20:56:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:09,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:09,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:09,989 INFO L87 Difference]: Start difference. First operand 43441 states and 72911 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:13,090 INFO L93 Difference]: Finished difference Result 140394 states and 235818 transitions. [2022-12-13 20:56:13,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:56:13,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-12-13 20:56:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:13,200 INFO L225 Difference]: With dead ends: 140394 [2022-12-13 20:56:13,201 INFO L226 Difference]: Without dead ends: 97181 [2022-12-13 20:56:13,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:13,221 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 505 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:13,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1573 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97181 states. [2022-12-13 20:56:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97181 to 70086. [2022-12-13 20:56:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70086 states, 70085 states have (on average 1.6690589997859742) internal successors, (116976), 70085 states have internal predecessors, (116976), 0 states have call successors, (0), 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 20:56:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70086 states to 70086 states and 116976 transitions. [2022-12-13 20:56:15,794 INFO L78 Accepts]: Start accepts. Automaton has 70086 states and 116976 transitions. Word has length 138 [2022-12-13 20:56:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:15,794 INFO L495 AbstractCegarLoop]: Abstraction has 70086 states and 116976 transitions. [2022-12-13 20:56:15,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 70086 states and 116976 transitions. [2022-12-13 20:56:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-13 20:56:15,795 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:15,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:15,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 20:56:15,795 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1351493516, now seen corresponding path program 1 times [2022-12-13 20:56:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:15,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840120986] [2022-12-13 20:56:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:16,020 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 20:56:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:16,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840120986] [2022-12-13 20:56:16,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840120986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:16,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:16,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:56:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421674460] [2022-12-13 20:56:16,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:16,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:56:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:16,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:56:16,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:56:16,023 INFO L87 Difference]: Start difference. First operand 70086 states and 116976 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:18,838 INFO L93 Difference]: Finished difference Result 139946 states and 233587 transitions. [2022-12-13 20:56:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:56:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-12-13 20:56:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:18,932 INFO L225 Difference]: With dead ends: 139946 [2022-12-13 20:56:18,932 INFO L226 Difference]: Without dead ends: 70088 [2022-12-13 20:56:18,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:56:18,972 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 138 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:18,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2298 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:56:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70088 states. [2022-12-13 20:56:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70088 to 70086. [2022-12-13 20:56:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70086 states, 70085 states have (on average 1.6601412570450167) internal successors, (116351), 70085 states have internal predecessors, (116351), 0 states have call successors, (0), 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 20:56:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70086 states to 70086 states and 116351 transitions. [2022-12-13 20:56:21,481 INFO L78 Accepts]: Start accepts. Automaton has 70086 states and 116351 transitions. Word has length 140 [2022-12-13 20:56:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:21,481 INFO L495 AbstractCegarLoop]: Abstraction has 70086 states and 116351 transitions. [2022-12-13 20:56:21,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 70086 states and 116351 transitions. [2022-12-13 20:56:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 20:56:21,482 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:21,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:21,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 20:56:21,483 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:21,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1927733203, now seen corresponding path program 1 times [2022-12-13 20:56:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:21,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192280612] [2022-12-13 20:56:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:21,653 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 20:56:21,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:21,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192280612] [2022-12-13 20:56:21,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192280612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:21,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:21,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:56:21,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317781061] [2022-12-13 20:56:21,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:21,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:56:21,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:21,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:56:21,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:56:21,655 INFO L87 Difference]: Start difference. First operand 70086 states and 116351 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:26,944 INFO L93 Difference]: Finished difference Result 204952 states and 340663 transitions. [2022-12-13 20:56:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:56:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-12-13 20:56:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:27,113 INFO L225 Difference]: With dead ends: 204952 [2022-12-13 20:56:27,113 INFO L226 Difference]: Without dead ends: 135094 [2022-12-13 20:56:27,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:56:27,140 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 535 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:27,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1858 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:56:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135094 states. [2022-12-13 20:56:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135094 to 135092. [2022-12-13 20:56:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135092 states, 135091 states have (on average 1.648222309406252) internal successors, (222660), 135091 states have internal predecessors, (222660), 0 states have call successors, (0), 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 20:56:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135092 states to 135092 states and 222660 transitions. [2022-12-13 20:56:32,255 INFO L78 Accepts]: Start accepts. Automaton has 135092 states and 222660 transitions. Word has length 143 [2022-12-13 20:56:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:32,255 INFO L495 AbstractCegarLoop]: Abstraction has 135092 states and 222660 transitions. [2022-12-13 20:56:32,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 135092 states and 222660 transitions. [2022-12-13 20:56:32,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-13 20:56:32,256 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:32,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:32,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 20:56:32,257 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash -801158179, now seen corresponding path program 1 times [2022-12-13 20:56:32,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:32,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952578009] [2022-12-13 20:56:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:32,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:32,456 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 20:56:32,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:32,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952578009] [2022-12-13 20:56:32,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952578009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:32,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:32,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:56:32,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880450017] [2022-12-13 20:56:32,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:32,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:56:32,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:56:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:32,458 INFO L87 Difference]: Start difference. First operand 135092 states and 222660 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 20:56:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:42,319 INFO L93 Difference]: Finished difference Result 263212 states and 428891 transitions. [2022-12-13 20:56:42,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:56:42,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2022-12-13 20:56:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:42,724 INFO L225 Difference]: With dead ends: 263212 [2022-12-13 20:56:42,724 INFO L226 Difference]: Without dead ends: 263210 [2022-12-13 20:56:42,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:56:42,774 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 469 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:42,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 2052 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263210 states. [2022-12-13 20:56:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263210 to 140900. [2022-12-13 20:56:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140900 states, 140899 states have (on average 1.6213103002860205) internal successors, (228441), 140899 states have internal predecessors, (228441), 0 states have call successors, (0), 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 20:56:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140900 states to 140900 states and 228441 transitions. [2022-12-13 20:56:50,001 INFO L78 Accepts]: Start accepts. Automaton has 140900 states and 228441 transitions. Word has length 144 [2022-12-13 20:56:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:50,002 INFO L495 AbstractCegarLoop]: Abstraction has 140900 states and 228441 transitions. [2022-12-13 20:56:50,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 20:56:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 140900 states and 228441 transitions. [2022-12-13 20:56:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-13 20:56:50,006 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:50,006 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:50,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 20:56:50,006 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:56:50,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:50,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1109436188, now seen corresponding path program 1 times [2022-12-13 20:56:50,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:50,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165186286] [2022-12-13 20:56:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 20:56:50,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:50,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165186286] [2022-12-13 20:56:50,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165186286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:50,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:50,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:56:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600498092] [2022-12-13 20:56:50,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:50,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:56:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:56:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:56:50,125 INFO L87 Difference]: Start difference. First operand 140900 states and 228441 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 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 20:57:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:57:04,474 INFO L93 Difference]: Finished difference Result 387322 states and 629294 transitions. [2022-12-13 20:57:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:57:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 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 180 [2022-12-13 20:57:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:57:04,949 INFO L225 Difference]: With dead ends: 387322 [2022-12-13 20:57:04,949 INFO L226 Difference]: Without dead ends: 324820 [2022-12-13 20:57:04,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:57:04,998 INFO L413 NwaCegarLoop]: 656 mSDtfsCounter, 1027 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:57:04,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 2519 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:57:05,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324820 states. [2022-12-13 20:57:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324820 to 227128. [2022-12-13 20:57:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227128 states, 227127 states have (on average 1.6181475562130438) internal successors, (367525), 227127 states have internal predecessors, (367525), 0 states have call successors, (0), 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 20:57:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227128 states to 227128 states and 367525 transitions. [2022-12-13 20:57:17,367 INFO L78 Accepts]: Start accepts. Automaton has 227128 states and 367525 transitions. Word has length 180 [2022-12-13 20:57:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:57:17,367 INFO L495 AbstractCegarLoop]: Abstraction has 227128 states and 367525 transitions. [2022-12-13 20:57:17,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 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 20:57:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 227128 states and 367525 transitions. [2022-12-13 20:57:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-13 20:57:17,371 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:57:17,371 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:57:17,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 20:57:17,371 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:57:17,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:57:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1123216246, now seen corresponding path program 1 times [2022-12-13 20:57:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:57:17,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260174945] [2022-12-13 20:57:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:57:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:57:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:57:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 20:57:17,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:57:17,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260174945] [2022-12-13 20:57:17,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260174945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:57:17,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:57:17,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:57:17,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141994640] [2022-12-13 20:57:17,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:57:17,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:57:17,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:57:17,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:57:17,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:57:17,486 INFO L87 Difference]: Start difference. First operand 227128 states and 367525 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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 20:57:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:57:34,670 INFO L93 Difference]: Finished difference Result 427514 states and 694714 transitions. [2022-12-13 20:57:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:57:34,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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 180 [2022-12-13 20:57:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:57:35,337 INFO L225 Difference]: With dead ends: 427514 [2022-12-13 20:57:35,337 INFO L226 Difference]: Without dead ends: 365012 [2022-12-13 20:57:35,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:57:35,411 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 1094 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:57:35,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 2407 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:57:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365012 states. [2022-12-13 20:57:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365012 to 307988. [2022-12-13 20:57:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307988 states, 307987 states have (on average 1.618402724790332) internal successors, (498447), 307987 states have internal predecessors, (498447), 0 states have call successors, (0), 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 20:57:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307988 states to 307988 states and 498447 transitions. [2022-12-13 20:57:52,468 INFO L78 Accepts]: Start accepts. Automaton has 307988 states and 498447 transitions. Word has length 180 [2022-12-13 20:57:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:57:52,469 INFO L495 AbstractCegarLoop]: Abstraction has 307988 states and 498447 transitions. [2022-12-13 20:57:52,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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 20:57:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 307988 states and 498447 transitions. [2022-12-13 20:57:52,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-13 20:57:52,473 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:57:52,473 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:57:52,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 20:57:52,473 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:57:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:57:52,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1614379100, now seen corresponding path program 1 times [2022-12-13 20:57:52,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:57:52,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413303227] [2022-12-13 20:57:52,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:57:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:57:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:57:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 20:57:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:57:52,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413303227] [2022-12-13 20:57:52,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413303227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:57:52,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:57:52,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:57:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108231809] [2022-12-13 20:57:52,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:57:52,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:57:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:57:52,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:57:52,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:57:52,719 INFO L87 Difference]: Start difference. First operand 307988 states and 498447 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 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 20:58:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:58:11,654 INFO L93 Difference]: Finished difference Result 452674 states and 735554 transitions. [2022-12-13 20:58:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:58:11,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 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 180 [2022-12-13 20:58:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:58:12,268 INFO L225 Difference]: With dead ends: 452674 [2022-12-13 20:58:12,269 INFO L226 Difference]: Without dead ends: 390172 [2022-12-13 20:58:12,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:58:12,353 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 1046 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:58:12,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 2486 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:58:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390172 states. [2022-12-13 20:58:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390172 to 357348. [2022-12-13 20:58:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357348 states, 357347 states have (on average 1.6197673409878912) internal successors, (578819), 357347 states have internal predecessors, (578819), 0 states have call successors, (0), 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 20:58:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357348 states to 357348 states and 578819 transitions. [2022-12-13 20:58:33,770 INFO L78 Accepts]: Start accepts. Automaton has 357348 states and 578819 transitions. Word has length 180 [2022-12-13 20:58:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:58:33,771 INFO L495 AbstractCegarLoop]: Abstraction has 357348 states and 578819 transitions. [2022-12-13 20:58:33,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 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 20:58:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 357348 states and 578819 transitions. [2022-12-13 20:58:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-13 20:58:33,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:58:33,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:58:33,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 20:58:33,775 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:58:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:58:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash 880944204, now seen corresponding path program 1 times [2022-12-13 20:58:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:58:33,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935166920] [2022-12-13 20:58:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:58:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:58:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:58:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:58:33,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:58:33,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935166920] [2022-12-13 20:58:33,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935166920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:58:33,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:58:33,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:58:33,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487549506] [2022-12-13 20:58:33,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:58:33,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:58:33,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:58:33,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:58:33,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:58:33,831 INFO L87 Difference]: Start difference. First operand 357348 states and 578819 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 20:59:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:59:08,607 INFO L93 Difference]: Finished difference Result 721119 states and 1170771 transitions. [2022-12-13 20:59:08,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:59:08,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 180 [2022-12-13 20:59:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:59:09,716 INFO L225 Difference]: With dead ends: 721119 [2022-12-13 20:59:09,716 INFO L226 Difference]: Without dead ends: 657317 [2022-12-13 20:59:09,834 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 20:59:09,835 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 123 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:59:09,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 943 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:59:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657317 states. [2022-12-13 20:59:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657317 to 656640. [2022-12-13 20:59:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656640 states, 656639 states have (on average 1.6210490086638167) internal successors, (1064444), 656639 states have internal predecessors, (1064444), 0 states have call successors, (0), 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 20:59:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656640 states to 656640 states and 1064444 transitions. [2022-12-13 20:59:49,848 INFO L78 Accepts]: Start accepts. Automaton has 656640 states and 1064444 transitions. Word has length 180 [2022-12-13 20:59:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:59:49,848 INFO L495 AbstractCegarLoop]: Abstraction has 656640 states and 1064444 transitions. [2022-12-13 20:59:49,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 20:59:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 656640 states and 1064444 transitions. [2022-12-13 20:59:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-12-13 20:59:49,853 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:59:49,853 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:59:49,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 20:59:49,853 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:59:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:59:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1129495568, now seen corresponding path program 1 times [2022-12-13 20:59:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:59:49,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135967012] [2022-12-13 20:59:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:59:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:59:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:59:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:59:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:59:49,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135967012] [2022-12-13 20:59:49,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135967012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:59:49,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:59:49,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:59:49,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158914756] [2022-12-13 20:59:49,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:59:49,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:59:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:59:49,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:59:49,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:59:49,914 INFO L87 Difference]: Start difference. First operand 656640 states and 1064444 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 21:01:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:01:03,136 INFO L93 Difference]: Finished difference Result 1959154 states and 3171813 transitions. [2022-12-13 21:01:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:01:03,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2022-12-13 21:01:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:01:05,629 INFO L225 Difference]: With dead ends: 1959154 [2022-12-13 21:01:05,629 INFO L226 Difference]: Without dead ends: 1302557 [2022-12-13 21:01:06,195 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 21:01:06,196 INFO L413 NwaCegarLoop]: 808 mSDtfsCounter, 412 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:01:06,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1287 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:01:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302557 states. [2022-12-13 21:02:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302557 to 1302555. [2022-12-13 21:02:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302555 states, 1302554 states have (on average 1.609718291909587) internal successors, (2096745), 1302554 states have internal predecessors, (2096745), 0 states have call successors, (0), 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 21:02:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302555 states to 1302555 states and 2096745 transitions. [2022-12-13 21:02:26,505 INFO L78 Accepts]: Start accepts. Automaton has 1302555 states and 2096745 transitions. Word has length 181 [2022-12-13 21:02:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:02:26,506 INFO L495 AbstractCegarLoop]: Abstraction has 1302555 states and 2096745 transitions. [2022-12-13 21:02:26,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 21:02:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1302555 states and 2096745 transitions. [2022-12-13 21:02:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-12-13 21:02:26,515 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:02:26,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:02:26,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 21:02:26,515 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:02:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:02:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -577772355, now seen corresponding path program 1 times [2022-12-13 21:02:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:02:26,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624102339] [2022-12-13 21:02:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:02:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:02:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:02:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 21:02:26,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:02:26,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624102339] [2022-12-13 21:02:26,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624102339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:02:26,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:02:26,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:02:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340809085] [2022-12-13 21:02:26,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:02:26,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:02:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:02:26,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:02:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:02:26,597 INFO L87 Difference]: Start difference. First operand 1302555 states and 2096745 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 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 21:03:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:03:41,890 INFO L93 Difference]: Finished difference Result 2079175 states and 3355244 transitions. [2022-12-13 21:03:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:03:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 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 181 [2022-12-13 21:03:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:03:44,684 INFO L225 Difference]: With dead ends: 2079175 [2022-12-13 21:03:44,685 INFO L226 Difference]: Without dead ends: 1395423 [2022-12-13 21:03:45,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:03:45,075 INFO L413 NwaCegarLoop]: 654 mSDtfsCounter, 274 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:03:45,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1595 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:03:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395423 states. [2022-12-13 21:04:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395423 to 887757. [2022-12-13 21:04:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887757 states, 887756 states have (on average 1.6061293869036086) internal successors, (1425851), 887756 states have internal predecessors, (1425851), 0 states have call successors, (0), 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 21:04:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887757 states to 887757 states and 1425851 transitions. [2022-12-13 21:04:50,231 INFO L78 Accepts]: Start accepts. Automaton has 887757 states and 1425851 transitions. Word has length 181 [2022-12-13 21:04:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:50,231 INFO L495 AbstractCegarLoop]: Abstraction has 887757 states and 1425851 transitions. [2022-12-13 21:04:50,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 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 21:04:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 887757 states and 1425851 transitions. [2022-12-13 21:04:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-12-13 21:04:50,238 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:50,239 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:04:50,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 21:04:50,239 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:50,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash 269141578, now seen corresponding path program 1 times [2022-12-13 21:04:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:50,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994858597] [2022-12-13 21:04:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:50,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:04:50,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:50,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994858597] [2022-12-13 21:04:50,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994858597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:50,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:50,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:04:50,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335757029] [2022-12-13 21:04:50,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:50,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:04:50,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:50,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:04:50,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:04:50,308 INFO L87 Difference]: Start difference. First operand 887757 states and 1425851 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)