./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R --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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:33:06,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:33:06,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:33:06,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:33:06,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:33:06,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:33:06,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:33:06,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:33:06,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:33:06,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:33:06,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:33:06,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:33:06,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:33:06,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:33:06,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:33:06,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:33:06,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:33:06,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:33:06,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:33:06,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:33:06,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:33:06,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:33:06,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:33:06,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:33:06,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:33:06,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:33:06,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:33:06,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:33:06,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:33:06,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:33:06,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:33:06,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:33:06,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:33:06,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:33:06,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:33:06,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:33:06,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:33:06,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:33:06,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:33:06,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:33:06,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:33:06,164 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:33:06,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:33:06,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:33:06,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:33:06,209 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:33:06,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:33:06,210 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:33:06,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:33:06,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:33:06,211 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:33:06,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:33:06,213 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:33:06,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:33:06,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:33:06,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:33:06,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:33:06,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:33:06,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:33:06,214 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:33:06,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:33:06,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:33:06,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:33:06,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:33:06,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:33:06,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:33:06,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:33:06,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:33:06,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:33:06,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:33:06,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:33:06,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:33:06,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:33:06,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:33:06,218 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:33:06,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:33:06,219 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_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/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_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2022-11-25 15:33:06,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:33:06,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:33:06,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:33:06,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:33:06,501 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:33:06,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/locks/test_locks_6.c [2022-11-25 15:33:09,524 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:33:09,811 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:33:09,811 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/sv-benchmarks/c/locks/test_locks_6.c [2022-11-25 15:33:09,818 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/data/ee8f73dd3/c1758da25c784340b76f9722452fdc83/FLAGc600aef22 [2022-11-25 15:33:09,839 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/data/ee8f73dd3/c1758da25c784340b76f9722452fdc83 [2022-11-25 15:33:09,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:33:09,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:33:09,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:33:09,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:33:09,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:33:09,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:33:09" (1/1) ... [2022-11-25 15:33:09,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e86ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:09, skipping insertion in model container [2022-11-25 15:33:09,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:33:09" (1/1) ... [2022-11-25 15:33:09,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:33:09,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:33:10,110 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_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2022-11-25 15:33:10,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:33:10,124 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:33:10,142 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_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2022-11-25 15:33:10,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:33:10,156 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:33:10,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10 WrapperNode [2022-11-25 15:33:10,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:33:10,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:33:10,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:33:10,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:33:10,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,193 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 94 [2022-11-25 15:33:10,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:33:10,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:33:10,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:33:10,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:33:10,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,213 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:33:10,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:33:10,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:33:10,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:33:10,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (1/1) ... [2022-11-25 15:33:10,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:33:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:33:10,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:33:10,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:33:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:33:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:33:10,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:33:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:33:10,360 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:33:10,362 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:33:10,515 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:33:10,521 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:33:10,522 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:33:10,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:33:10 BoogieIcfgContainer [2022-11-25 15:33:10,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:33:10,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:33:10,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:33:10,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:33:10,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:33:09" (1/3) ... [2022-11-25 15:33:10,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86466c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:33:10, skipping insertion in model container [2022-11-25 15:33:10,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:33:10" (2/3) ... [2022-11-25 15:33:10,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86466c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:33:10, skipping insertion in model container [2022-11-25 15:33:10,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:33:10" (3/3) ... [2022-11-25 15:33:10,534 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-11-25 15:33:10,554 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:33:10,554 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:33:10,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:33:10,628 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;@42b4b99f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:33:10,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:33:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 15:33:10,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:10,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:10,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash -721193823, now seen corresponding path program 1 times [2022-11-25 15:33:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:10,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058691224] [2022-11-25 15:33:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:10,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:10,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058691224] [2022-11-25 15:33:10,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058691224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:10,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:10,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497729358] [2022-11-25 15:33:10,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:10,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:10,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:10,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:10,941 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:10,978 INFO L93 Difference]: Finished difference Result 59 states and 97 transitions. [2022-11-25 15:33:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 15:33:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:11,002 INFO L225 Difference]: With dead ends: 59 [2022-11-25 15:33:11,002 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 15:33:11,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,009 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:11,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 15:33:11,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-11-25 15:33:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2022-11-25 15:33:11,047 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 13 [2022-11-25 15:33:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:11,048 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2022-11-25 15:33:11,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2022-11-25 15:33:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 15:33:11,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:11,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:11,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:33:11,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash -41135453, now seen corresponding path program 1 times [2022-11-25 15:33:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:11,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290510236] [2022-11-25 15:33:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:11,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:11,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290510236] [2022-11-25 15:33:11,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290510236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:11,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:11,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:11,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944048304] [2022-11-25 15:33:11,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:11,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,116 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:11,139 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2022-11-25 15:33:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 15:33:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:11,141 INFO L225 Difference]: With dead ends: 74 [2022-11-25 15:33:11,141 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 15:33:11,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,143 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:11,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 87 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 15:33:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-11-25 15:33:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-11-25 15:33:11,151 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 13 [2022-11-25 15:33:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:11,152 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-11-25 15:33:11,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-11-25 15:33:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 15:33:11,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:11,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:11,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:33:11,154 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash -881957389, now seen corresponding path program 1 times [2022-11-25 15:33:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:11,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711313971] [2022-11-25 15:33:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:11,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:11,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:11,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711313971] [2022-11-25 15:33:11,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711313971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:11,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:11,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663710637] [2022-11-25 15:33:11,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:11,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:11,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:11,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,225 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:11,245 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2022-11-25 15:33:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:11,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 15:33:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:11,247 INFO L225 Difference]: With dead ends: 69 [2022-11-25 15:33:11,247 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 15:33:11,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,249 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:11,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 96 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 15:33:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-11-25 15:33:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2022-11-25 15:33:11,280 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 14 [2022-11-25 15:33:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:11,280 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2022-11-25 15:33:11,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2022-11-25 15:33:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 15:33:11,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:11,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:11,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:33:11,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1274984399, now seen corresponding path program 1 times [2022-11-25 15:33:11,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:11,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952863806] [2022-11-25 15:33:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:11,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952863806] [2022-11-25 15:33:11,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952863806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:11,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:11,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147460263] [2022-11-25 15:33:11,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:11,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:11,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:11,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,383 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:11,412 INFO L93 Difference]: Finished difference Result 85 states and 141 transitions. [2022-11-25 15:33:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:11,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 15:33:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:11,414 INFO L225 Difference]: With dead ends: 85 [2022-11-25 15:33:11,414 INFO L226 Difference]: Without dead ends: 83 [2022-11-25 15:33:11,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,416 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:11,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-25 15:33:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2022-11-25 15:33:11,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 101 transitions. [2022-11-25 15:33:11,425 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 101 transitions. Word has length 14 [2022-11-25 15:33:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:11,426 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 101 transitions. [2022-11-25 15:33:11,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 101 transitions. [2022-11-25 15:33:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 15:33:11,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:11,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:11,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:33:11,428 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash -594926029, now seen corresponding path program 1 times [2022-11-25 15:33:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:11,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892527294] [2022-11-25 15:33:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:11,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:11,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892527294] [2022-11-25 15:33:11,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892527294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:11,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:11,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:11,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198324926] [2022-11-25 15:33:11,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:11,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:11,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:11,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:11,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,471 INFO L87 Difference]: Start difference. First operand 61 states and 101 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:11,492 INFO L93 Difference]: Finished difference Result 141 states and 235 transitions. [2022-11-25 15:33:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:11,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 15:33:11,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:11,494 INFO L225 Difference]: With dead ends: 141 [2022-11-25 15:33:11,494 INFO L226 Difference]: Without dead ends: 85 [2022-11-25 15:33:11,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,496 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:11,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 88 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:11,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-25 15:33:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-11-25 15:33:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 135 transitions. [2022-11-25 15:33:11,506 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 135 transitions. Word has length 14 [2022-11-25 15:33:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:11,506 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 135 transitions. [2022-11-25 15:33:11,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 135 transitions. [2022-11-25 15:33:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:33:11,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:11,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:11,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:33:11,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash -869595720, now seen corresponding path program 1 times [2022-11-25 15:33:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:11,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098998288] [2022-11-25 15:33:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:11,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:11,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098998288] [2022-11-25 15:33:11,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098998288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:11,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:11,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:11,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668344736] [2022-11-25 15:33:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:11,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:11,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:11,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:11,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,550 INFO L87 Difference]: Start difference. First operand 83 states and 135 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:11,568 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2022-11-25 15:33:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:11,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 15:33:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:11,569 INFO L225 Difference]: With dead ends: 126 [2022-11-25 15:33:11,569 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 15:33:11,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,571 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:11,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 92 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 15:33:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-11-25 15:33:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2022-11-25 15:33:11,580 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 15 [2022-11-25 15:33:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:11,581 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2022-11-25 15:33:11,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2022-11-25 15:33:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:33:11,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:11,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:11,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:33:11,582 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:11,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1262622730, now seen corresponding path program 1 times [2022-11-25 15:33:11,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:11,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991432801] [2022-11-25 15:33:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:11,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:11,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:11,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991432801] [2022-11-25 15:33:11,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991432801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:11,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:11,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720295174] [2022-11-25 15:33:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:11,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,669 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:11,708 INFO L93 Difference]: Finished difference Result 237 states and 377 transitions. [2022-11-25 15:33:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 15:33:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:11,720 INFO L225 Difference]: With dead ends: 237 [2022-11-25 15:33:11,720 INFO L226 Difference]: Without dead ends: 159 [2022-11-25 15:33:11,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,722 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:11,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 79 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-25 15:33:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-11-25 15:33:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2022-11-25 15:33:11,745 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 15 [2022-11-25 15:33:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:11,746 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2022-11-25 15:33:11,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2022-11-25 15:33:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:33:11,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:11,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:11,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:33:11,748 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1942681100, now seen corresponding path program 1 times [2022-11-25 15:33:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:11,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040393400] [2022-11-25 15:33:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:11,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:11,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040393400] [2022-11-25 15:33:11,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040393400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:11,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:11,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:11,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222220205] [2022-11-25 15:33:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:11,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:11,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:11,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:11,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,824 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:11,852 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2022-11-25 15:33:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:11,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 15:33:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:11,854 INFO L225 Difference]: With dead ends: 193 [2022-11-25 15:33:11,855 INFO L226 Difference]: Without dead ends: 191 [2022-11-25 15:33:11,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,857 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 22 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:11,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 98 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-25 15:33:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2022-11-25 15:33:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 239 transitions. [2022-11-25 15:33:11,886 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 239 transitions. Word has length 15 [2022-11-25 15:33:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:11,886 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 239 transitions. [2022-11-25 15:33:11,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 239 transitions. [2022-11-25 15:33:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 15:33:11,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:11,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:11,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:33:11,893 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:11,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:11,894 INFO L85 PathProgramCache]: Analyzing trace with hash -486383640, now seen corresponding path program 1 times [2022-11-25 15:33:11,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:11,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243078895] [2022-11-25 15:33:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:11,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:11,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:11,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243078895] [2022-11-25 15:33:11,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243078895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:11,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:11,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:11,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376165953] [2022-11-25 15:33:11,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:11,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:11,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:11,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:11,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,950 INFO L87 Difference]: Start difference. First operand 157 states and 239 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:11,986 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2022-11-25 15:33:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 15:33:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:11,993 INFO L225 Difference]: With dead ends: 277 [2022-11-25 15:33:11,993 INFO L226 Difference]: Without dead ends: 275 [2022-11-25 15:33:11,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:11,995 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:11,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-25 15:33:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 225. [2022-11-25 15:33:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 335 transitions. [2022-11-25 15:33:12,023 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 335 transitions. Word has length 16 [2022-11-25 15:33:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:12,024 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 335 transitions. [2022-11-25 15:33:12,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 335 transitions. [2022-11-25 15:33:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 15:33:12,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:12,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:12,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:33:12,030 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:12,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash 193674730, now seen corresponding path program 1 times [2022-11-25 15:33:12,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:12,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36483102] [2022-11-25 15:33:12,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:12,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:12,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:12,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36483102] [2022-11-25 15:33:12,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36483102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:12,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:12,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481543605] [2022-11-25 15:33:12,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:12,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:12,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:12,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,084 INFO L87 Difference]: Start difference. First operand 225 states and 335 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:12,113 INFO L93 Difference]: Finished difference Result 517 states and 769 transitions. [2022-11-25 15:33:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 15:33:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:12,117 INFO L225 Difference]: With dead ends: 517 [2022-11-25 15:33:12,117 INFO L226 Difference]: Without dead ends: 299 [2022-11-25 15:33:12,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,122 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:12,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-25 15:33:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2022-11-25 15:33:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 427 transitions. [2022-11-25 15:33:12,158 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 427 transitions. Word has length 16 [2022-11-25 15:33:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:12,159 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 427 transitions. [2022-11-25 15:33:12,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 427 transitions. [2022-11-25 15:33:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:33:12,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:12,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:12,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:33:12,161 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:12,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:12,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2102192011, now seen corresponding path program 1 times [2022-11-25 15:33:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:12,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910190780] [2022-11-25 15:33:12,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:12,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:12,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:12,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910190780] [2022-11-25 15:33:12,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910190780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:12,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:12,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:12,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944815906] [2022-11-25 15:33:12,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:12,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:12,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,227 INFO L87 Difference]: Start difference. First operand 297 states and 427 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:12,254 INFO L93 Difference]: Finished difference Result 453 states and 649 transitions. [2022-11-25 15:33:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:12,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 15:33:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:12,256 INFO L225 Difference]: With dead ends: 453 [2022-11-25 15:33:12,256 INFO L226 Difference]: Without dead ends: 311 [2022-11-25 15:33:12,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,259 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:12,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 84 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-25 15:33:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-11-25 15:33:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 435 transitions. [2022-11-25 15:33:12,279 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 435 transitions. Word has length 17 [2022-11-25 15:33:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:12,280 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 435 transitions. [2022-11-25 15:33:12,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 435 transitions. [2022-11-25 15:33:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:33:12,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:12,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:12,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:33:12,286 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:12,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1709165001, now seen corresponding path program 1 times [2022-11-25 15:33:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:12,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748151872] [2022-11-25 15:33:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:12,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:12,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748151872] [2022-11-25 15:33:12,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748151872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:12,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:12,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:12,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073903288] [2022-11-25 15:33:12,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:12,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:12,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:12,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:12,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,323 INFO L87 Difference]: Start difference. First operand 309 states and 435 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:12,345 INFO L93 Difference]: Finished difference Result 521 states and 733 transitions. [2022-11-25 15:33:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:12,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 15:33:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:12,347 INFO L225 Difference]: With dead ends: 521 [2022-11-25 15:33:12,348 INFO L226 Difference]: Without dead ends: 519 [2022-11-25 15:33:12,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,349 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:12,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-25 15:33:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 453. [2022-11-25 15:33:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 619 transitions. [2022-11-25 15:33:12,367 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 619 transitions. Word has length 17 [2022-11-25 15:33:12,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:12,367 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 619 transitions. [2022-11-25 15:33:12,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 619 transitions. [2022-11-25 15:33:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:33:12,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:12,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:12,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:33:12,369 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:12,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1905743925, now seen corresponding path program 1 times [2022-11-25 15:33:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:12,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147345254] [2022-11-25 15:33:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:12,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:12,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147345254] [2022-11-25 15:33:12,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147345254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:12,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:12,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:12,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358849457] [2022-11-25 15:33:12,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:12,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:12,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:12,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,393 INFO L87 Difference]: Start difference. First operand 453 states and 619 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:12,422 INFO L93 Difference]: Finished difference Result 1017 states and 1373 transitions. [2022-11-25 15:33:12,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:12,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 15:33:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:12,425 INFO L225 Difference]: With dead ends: 1017 [2022-11-25 15:33:12,425 INFO L226 Difference]: Without dead ends: 583 [2022-11-25 15:33:12,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,426 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 24 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:12,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 91 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-11-25 15:33:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2022-11-25 15:33:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 755 transitions. [2022-11-25 15:33:12,455 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 755 transitions. Word has length 17 [2022-11-25 15:33:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:12,456 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 755 transitions. [2022-11-25 15:33:12,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 755 transitions. [2022-11-25 15:33:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 15:33:12,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:12,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:12,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:33:12,458 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1444723487, now seen corresponding path program 1 times [2022-11-25 15:33:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:12,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333322386] [2022-11-25 15:33:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:12,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333322386] [2022-11-25 15:33:12,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333322386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:12,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:12,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845349297] [2022-11-25 15:33:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:12,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,483 INFO L87 Difference]: Start difference. First operand 581 states and 755 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:12,539 INFO L93 Difference]: Finished difference Result 873 states and 1125 transitions. [2022-11-25 15:33:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 15:33:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:12,545 INFO L225 Difference]: With dead ends: 873 [2022-11-25 15:33:12,545 INFO L226 Difference]: Without dead ends: 599 [2022-11-25 15:33:12,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,547 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:12,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-11-25 15:33:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2022-11-25 15:33:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 755 transitions. [2022-11-25 15:33:12,578 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 755 transitions. Word has length 18 [2022-11-25 15:33:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:12,580 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 755 transitions. [2022-11-25 15:33:12,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 755 transitions. [2022-11-25 15:33:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 15:33:12,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:12,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:12,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:33:12,582 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1051696477, now seen corresponding path program 1 times [2022-11-25 15:33:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:12,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379552601] [2022-11-25 15:33:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:12,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:12,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379552601] [2022-11-25 15:33:12,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379552601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:12,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:12,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889382777] [2022-11-25 15:33:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:12,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:12,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,615 INFO L87 Difference]: Start difference. First operand 597 states and 755 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:12,653 INFO L93 Difference]: Finished difference Result 967 states and 1204 transitions. [2022-11-25 15:33:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:12,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 15:33:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:12,657 INFO L225 Difference]: With dead ends: 967 [2022-11-25 15:33:12,657 INFO L226 Difference]: Without dead ends: 965 [2022-11-25 15:33:12,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,660 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:12,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-11-25 15:33:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 901. [2022-11-25 15:33:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1107 transitions. [2022-11-25 15:33:12,692 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1107 transitions. Word has length 18 [2022-11-25 15:33:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:12,692 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1107 transitions. [2022-11-25 15:33:12,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1107 transitions. [2022-11-25 15:33:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 15:33:12,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:12,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:12,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:33:12,696 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:33:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:12,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1731754847, now seen corresponding path program 1 times [2022-11-25 15:33:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:12,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312418145] [2022-11-25 15:33:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:12,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:12,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312418145] [2022-11-25 15:33:12,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312418145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:12,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:12,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:12,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233749682] [2022-11-25 15:33:12,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:12,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:12,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,728 INFO L87 Difference]: Start difference. First operand 901 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:12,778 INFO L93 Difference]: Finished difference Result 1989 states and 2387 transitions. [2022-11-25 15:33:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:12,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 15:33:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:12,780 INFO L225 Difference]: With dead ends: 1989 [2022-11-25 15:33:12,780 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 15:33:12,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:12,782 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:12,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 15:33:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 15:33:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 15:33:12,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-11-25 15:33:12,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:12,784 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:33:12,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 15:33:12,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 15:33:12,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 15:33:12,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:33:12,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 15:33:12,800 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,801 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-25 15:33:12,801 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,801 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 15:33:12,801 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,801 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 15:33:12,801 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-11-25 15:33:12,802 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,802 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-11-25 15:33:12,802 INFO L902 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-11-25 15:33:12,802 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2022-11-25 15:33:12,802 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,802 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,803 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,803 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 50) no Hoare annotation was computed. [2022-11-25 15:33:12,803 INFO L899 garLoopResultBuilder]: For program point L48-2(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,803 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 15:33:12,803 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2022-11-25 15:33:12,803 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2022-11-25 15:33:12,804 INFO L899 garLoopResultBuilder]: For program point L74-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,804 INFO L902 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-11-25 15:33:12,804 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 15:33:12,804 INFO L902 garLoopResultBuilder]: At program point L108(lines 6 109) the Hoare annotation is: true [2022-11-25 15:33:12,804 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2022-11-25 15:33:12,804 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-11-25 15:33:12,805 INFO L895 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-11-25 15:33:12,805 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,805 INFO L899 garLoopResultBuilder]: For program point L68-1(lines 29 104) no Hoare annotation was computed. [2022-11-25 15:33:12,810 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:12,813 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:33:12,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:33:12 BoogieIcfgContainer [2022-11-25 15:33:12,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:33:12,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:33:12,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:33:12,824 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:33:12,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:33:10" (3/4) ... [2022-11-25 15:33:12,827 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 15:33:12,837 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-25 15:33:12,837 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 15:33:12,838 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 15:33:12,838 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 15:33:12,873 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:33:12,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:33:12,873 INFO L158 Benchmark]: Toolchain (without parser) took 3029.58ms. Allocated memory is still 199.2MB. Free memory was 168.0MB in the beginning and 100.2MB in the end (delta: 67.8MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2022-11-25 15:33:12,874 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 136.3MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:33:12,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.08ms. Allocated memory is still 199.2MB. Free memory was 167.5MB in the beginning and 157.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 15:33:12,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.40ms. Allocated memory is still 199.2MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:33:12,874 INFO L158 Benchmark]: Boogie Preprocessor took 22.31ms. Allocated memory is still 199.2MB. Free memory was 155.5MB in the beginning and 154.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:33:12,875 INFO L158 Benchmark]: RCFGBuilder took 307.01ms. Allocated memory is still 199.2MB. Free memory was 154.3MB in the beginning and 142.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 15:33:12,875 INFO L158 Benchmark]: TraceAbstraction took 2296.67ms. Allocated memory is still 199.2MB. Free memory was 141.7MB in the beginning and 103.3MB in the end (delta: 38.4MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-11-25 15:33:12,875 INFO L158 Benchmark]: Witness Printer took 48.90ms. Allocated memory is still 199.2MB. Free memory was 103.3MB in the beginning and 100.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:33:12,877 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 136.3MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.08ms. Allocated memory is still 199.2MB. Free memory was 167.5MB in the beginning and 157.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.40ms. Allocated memory is still 199.2MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.31ms. Allocated memory is still 199.2MB. Free memory was 155.5MB in the beginning and 154.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.01ms. Allocated memory is still 199.2MB. Free memory was 154.3MB in the beginning and 142.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2296.67ms. Allocated memory is still 199.2MB. Free memory was 141.7MB in the beginning and 103.3MB in the end (delta: 38.4MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Witness Printer took 48.90ms. Allocated memory is still 199.2MB. Free memory was 103.3MB in the beginning and 100.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 1355 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 527 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 828 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=901occurred in iteration=15, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 73 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-11-25 15:33:12,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_704cde65-f40d-4b1a-bdca-d8fa3bd541c5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE