./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:55:59,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:55:59,450 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:55:59,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:55:59,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:55:59,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:55:59,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:55:59,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:55:59,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:55:59,500 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:55:59,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:55:59,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:55:59,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:55:59,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:55:59,503 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:55:59,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:55:59,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:55:59,507 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:55:59,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:55:59,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:55:59,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:55:59,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:55:59,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:55:59,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:55:59,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:55:59,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:55:59,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:55:59,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:55:59,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:55:59,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:55:59,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:55:59,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:55:59,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:55:59,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:55:59,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:55:59,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:55:59,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:55:59,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:55:59,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:55:59,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:55:59,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:55:59,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:55:59,520 INFO L153 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_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/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_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c [2024-10-31 21:55:59,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:55:59,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:55:59,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:55:59,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:55:59,861 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:55:59,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c Unable to find full path for "g++" [2024-10-31 21:56:01,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:56:02,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:56:02,229 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c [2024-10-31 21:56:02,247 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/data/4ddf45860/8c5aae027c3942cf866537f0c7313d2c/FLAGa4b8a6bd0 [2024-10-31 21:56:02,525 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/data/4ddf45860/8c5aae027c3942cf866537f0c7313d2c [2024-10-31 21:56:02,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:56:02,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:56:02,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:02,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:56:02,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:56:02,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e26e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:02, skipping insertion in model container [2024-10-31 21:56:02,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:02" (1/1) ... [2024-10-31 21:56:02,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:56:02,814 WARN L251 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_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c[911,924] [2024-10-31 21:56:02,891 WARN L251 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_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c[8416,8429] [2024-10-31 21:56:03,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:03,034 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:56:03,048 WARN L251 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_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c[911,924] [2024-10-31 21:56:03,090 WARN L251 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_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c[8416,8429] [2024-10-31 21:56:03,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:03,250 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:56:03,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03 WrapperNode [2024-10-31 21:56:03,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:03,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:03,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:56:03,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:56:03,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,356 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1046 [2024-10-31 21:56:03,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:03,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:56:03,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:56:03,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:56:03,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,414 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 21:56:03,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:56:03,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:56:03,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:56:03,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:56:03,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (1/1) ... [2024-10-31 21:56:03,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:56:03,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:56:03,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:56:03,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64b0c7e-b721-4cd6-b2f3-8abaa561d499/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:56:03,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:56:03,582 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-31 21:56:03,583 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-31 21:56:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-31 21:56:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-31 21:56:03,585 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-31 21:56:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-31 21:56:03,585 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-31 21:56:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-31 21:56:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-31 21:56:03,586 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-31 21:56:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-31 21:56:03,586 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-31 21:56:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-31 21:56:03,586 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-31 21:56:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-31 21:56:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-31 21:56:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-31 21:56:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-31 21:56:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-31 21:56:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-31 21:56:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-31 21:56:03,589 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-31 21:56:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:56:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-31 21:56:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-31 21:56:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-31 21:56:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-31 21:56:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:56:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:56:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-31 21:56:03,592 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-31 21:56:03,800 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:56:03,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:56:04,798 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-31 21:56:04,798 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-31 21:56:05,141 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-31 21:56:05,142 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:56:05,178 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:56:05,178 INFO L316 CfgBuilder]: Removed 18 assume(true) statements. [2024-10-31 21:56:05,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:05 BoogieIcfgContainer [2024-10-31 21:56:05,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:56:05,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:56:05,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:56:05,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:56:05,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:56:02" (1/3) ... [2024-10-31 21:56:05,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7b5d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:05, skipping insertion in model container [2024-10-31 21:56:05,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:03" (2/3) ... [2024-10-31 21:56:05,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7b5d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:05, skipping insertion in model container [2024-10-31 21:56:05,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:05" (3/3) ... [2024-10-31 21:56:05,193 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-2.c [2024-10-31 21:56:05,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:56:05,214 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 21:56:05,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:56:05,333 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4a90d5a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:56:05,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-31 21:56:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 486 states, 428 states have (on average 1.6168224299065421) internal successors, (692), 434 states have internal predecessors, (692), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-31 21:56:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-31 21:56:05,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:05,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:05,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:05,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:05,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1267420675, now seen corresponding path program 1 times [2024-10-31 21:56:05,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:05,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181652832] [2024-10-31 21:56:05,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 21:56:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:56:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:56:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:56:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:06,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181652832] [2024-10-31 21:56:06,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181652832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:06,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:06,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:56:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185801678] [2024-10-31 21:56:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:06,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:56:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:06,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:56:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:56:06,276 INFO L87 Difference]: Start difference. First operand has 486 states, 428 states have (on average 1.6168224299065421) internal successors, (692), 434 states have internal predecessors, (692), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 21:56:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:08,403 INFO L93 Difference]: Finished difference Result 1096 states and 1737 transitions. [2024-10-31 21:56:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 21:56:08,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-10-31 21:56:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:08,430 INFO L225 Difference]: With dead ends: 1096 [2024-10-31 21:56:08,432 INFO L226 Difference]: Without dead ends: 627 [2024-10-31 21:56:08,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-31 21:56:08,447 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 1225 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:08,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 2166 Invalid, 1550 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [184 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-31 21:56:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-31 21:56:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 588. [2024-10-31 21:56:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 510 states have (on average 1.511764705882353) internal successors, (771), 516 states have internal predecessors, (771), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2024-10-31 21:56:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 882 transitions. [2024-10-31 21:56:08,612 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 882 transitions. Word has length 65 [2024-10-31 21:56:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:08,613 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 882 transitions. [2024-10-31 21:56:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 21:56:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 882 transitions. [2024-10-31 21:56:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-31 21:56:08,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:08,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:08,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:56:08,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:08,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash 411467965, now seen corresponding path program 1 times [2024-10-31 21:56:08,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696966330] [2024-10-31 21:56:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 21:56:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:56:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:09,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:56:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:56:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:09,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:09,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696966330] [2024-10-31 21:56:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696966330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:09,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:09,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:56:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496436285] [2024-10-31 21:56:09,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:09,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:56:09,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:09,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:56:09,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:56:09,042 INFO L87 Difference]: Start difference. First operand 588 states and 882 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 21:56:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:11,214 INFO L93 Difference]: Finished difference Result 985 states and 1448 transitions. [2024-10-31 21:56:11,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 21:56:11,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-10-31 21:56:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:11,223 INFO L225 Difference]: With dead ends: 985 [2024-10-31 21:56:11,223 INFO L226 Difference]: Without dead ends: 776 [2024-10-31 21:56:11,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-31 21:56:11,226 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 1398 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:11,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 2497 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-31 21:56:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-31 21:56:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 700. [2024-10-31 21:56:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 600 states have (on average 1.495) internal successors, (897), 608 states have internal predecessors, (897), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-31 21:56:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1042 transitions. [2024-10-31 21:56:11,325 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1042 transitions. Word has length 65 [2024-10-31 21:56:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:11,325 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1042 transitions. [2024-10-31 21:56:11,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 21:56:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1042 transitions. [2024-10-31 21:56:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-31 21:56:11,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:11,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:11,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:56:11,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:11,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1617118145, now seen corresponding path program 1 times [2024-10-31 21:56:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814963525] [2024-10-31 21:56:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:11,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 21:56:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:56:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:56:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:56:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 21:56:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:56:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814963525] [2024-10-31 21:56:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814963525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:11,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:11,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:56:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410182801] [2024-10-31 21:56:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:11,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:56:11,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:11,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:56:11,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:56:11,521 INFO L87 Difference]: Start difference. First operand 700 states and 1042 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 21:56:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:13,010 INFO L93 Difference]: Finished difference Result 1372 states and 1984 transitions. [2024-10-31 21:56:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 21:56:13,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-10-31 21:56:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:13,018 INFO L225 Difference]: With dead ends: 1372 [2024-10-31 21:56:13,018 INFO L226 Difference]: Without dead ends: 1057 [2024-10-31 21:56:13,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-31 21:56:13,025 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 1506 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:13,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 1973 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-31 21:56:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-10-31 21:56:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 981. [2024-10-31 21:56:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 826 states have (on average 1.4576271186440677) internal successors, (1204), 838 states have internal predecessors, (1204), 97 states have call successors, (97), 49 states have call predecessors, (97), 56 states have return successors, (116), 97 states have call predecessors, (116), 95 states have call successors, (116) [2024-10-31 21:56:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1417 transitions. [2024-10-31 21:56:13,126 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1417 transitions. Word has length 65 [2024-10-31 21:56:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:13,127 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1417 transitions. [2024-10-31 21:56:13,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 21:56:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1417 transitions. [2024-10-31 21:56:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-31 21:56:13,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:13,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:13,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:56:13,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:13,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash 221241382, now seen corresponding path program 1 times [2024-10-31 21:56:13,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:13,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735770127] [2024-10-31 21:56:13,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:13,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:13,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 21:56:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:13,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:56:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:56:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:56:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-31 21:56:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-31 21:56:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:13,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:13,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735770127] [2024-10-31 21:56:13,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735770127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:13,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:13,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 21:56:13,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879083763] [2024-10-31 21:56:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:13,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:56:13,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:56:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:56:13,408 INFO L87 Difference]: Start difference. First operand 981 states and 1417 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 21:56:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:15,415 INFO L93 Difference]: Finished difference Result 1649 states and 2344 transitions. [2024-10-31 21:56:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 21:56:15,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-31 21:56:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:15,426 INFO L225 Difference]: With dead ends: 1649 [2024-10-31 21:56:15,427 INFO L226 Difference]: Without dead ends: 1053 [2024-10-31 21:56:15,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-31 21:56:15,432 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 624 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:15,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2908 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-31 21:56:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-10-31 21:56:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 996. [2024-10-31 21:56:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 838 states have (on average 1.4474940334128878) internal successors, (1213), 850 states have internal predecessors, (1213), 97 states have call successors, (97), 49 states have call predecessors, (97), 59 states have return successors, (119), 100 states have call predecessors, (119), 95 states have call successors, (119) [2024-10-31 21:56:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1429 transitions. [2024-10-31 21:56:15,521 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1429 transitions. Word has length 66 [2024-10-31 21:56:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:15,522 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1429 transitions. [2024-10-31 21:56:15,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 21:56:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1429 transitions. [2024-10-31 21:56:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-31 21:56:15,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:15,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:15,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:56:15,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:15,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash -808117916, now seen corresponding path program 1 times [2024-10-31 21:56:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:15,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386668790] [2024-10-31 21:56:15,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:15,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:15,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 21:56:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:15,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:56:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:56:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:15,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:56:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:15,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-31 21:56:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-31 21:56:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386668790] [2024-10-31 21:56:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386668790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:15,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 21:56:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418058447] [2024-10-31 21:56:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:15,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:56:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:15,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:56:15,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:56:15,765 INFO L87 Difference]: Start difference. First operand 996 states and 1429 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 21:56:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:19,037 INFO L93 Difference]: Finished difference Result 3201 states and 4550 transitions. [2024-10-31 21:56:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-31 21:56:19,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-10-31 21:56:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:19,046 INFO L225 Difference]: With dead ends: 3201 [2024-10-31 21:56:19,046 INFO L226 Difference]: Without dead ends: 1359 [2024-10-31 21:56:19,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-31 21:56:19,052 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 2539 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:19,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2559 Valid, 2764 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-31 21:56:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2024-10-31 21:56:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1204. [2024-10-31 21:56:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 990 states have (on average 1.4111111111111112) internal successors, (1397), 1006 states have internal predecessors, (1397), 127 states have call successors, (127), 70 states have call predecessors, (127), 85 states have return successors, (168), 131 states have call predecessors, (168), 125 states have call successors, (168) [2024-10-31 21:56:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1692 transitions. [2024-10-31 21:56:19,147 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1692 transitions. Word has length 66 [2024-10-31 21:56:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:19,148 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1692 transitions. [2024-10-31 21:56:19,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 21:56:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1692 transitions. [2024-10-31 21:56:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-31 21:56:19,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:19,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:19,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:56:19,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:19,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1893671899, now seen corresponding path program 1 times [2024-10-31 21:56:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:19,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729004231] [2024-10-31 21:56:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:19,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 21:56:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:56:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:56:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:19,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:56:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:56:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:19,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:56:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729004231] [2024-10-31 21:56:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729004231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 21:56:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60148880] [2024-10-31 21:56:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:19,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:56:19,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:56:19,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:56:19,353 INFO L87 Difference]: Start difference. First operand 1204 states and 1692 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 21:56:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:21,071 INFO L93 Difference]: Finished difference Result 2160 states and 2998 transitions. [2024-10-31 21:56:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 21:56:21,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-10-31 21:56:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:21,080 INFO L225 Difference]: With dead ends: 2160 [2024-10-31 21:56:21,080 INFO L226 Difference]: Without dead ends: 1341 [2024-10-31 21:56:21,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-31 21:56:21,084 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 621 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:21,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 2859 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-31 21:56:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-10-31 21:56:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1249. [2024-10-31 21:56:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1026 states have (on average 1.3966861598440545) internal successors, (1433), 1042 states have internal predecessors, (1433), 127 states have call successors, (127), 70 states have call predecessors, (127), 94 states have return successors, (177), 140 states have call predecessors, (177), 125 states have call successors, (177) [2024-10-31 21:56:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1737 transitions. [2024-10-31 21:56:21,183 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1737 transitions. Word has length 67 [2024-10-31 21:56:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:21,183 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1737 transitions. [2024-10-31 21:56:21,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 21:56:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1737 transitions. [2024-10-31 21:56:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-31 21:56:21,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:21,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:21,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:56:21,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:21,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash -507468505, now seen corresponding path program 1 times [2024-10-31 21:56:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473910241] [2024-10-31 21:56:21,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:21,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:21,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 21:56:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:21,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:56:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:56:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:56:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:56:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:56:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:21,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:21,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473910241] [2024-10-31 21:56:21,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473910241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:21,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:21,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:56:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105193002] [2024-10-31 21:56:21,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:21,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:56:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:21,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:56:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:56:21,462 INFO L87 Difference]: Start difference. First operand 1249 states and 1737 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 21:56:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:23,356 INFO L93 Difference]: Finished difference Result 2229 states and 3040 transitions. [2024-10-31 21:56:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-31 21:56:23,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2024-10-31 21:56:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:23,366 INFO L225 Difference]: With dead ends: 2229 [2024-10-31 21:56:23,366 INFO L226 Difference]: Without dead ends: 1452 [2024-10-31 21:56:23,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-31 21:56:23,370 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 1418 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:23,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 2092 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-31 21:56:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-10-31 21:56:23,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1258. [2024-10-31 21:56:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1035 states have (on average 1.391304347826087) internal successors, (1440), 1049 states have internal predecessors, (1440), 128 states have call successors, (128), 71 states have call predecessors, (128), 93 states have return successors, (173), 141 states have call predecessors, (173), 126 states have call successors, (173) [2024-10-31 21:56:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1741 transitions. [2024-10-31 21:56:23,493 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1741 transitions. Word has length 67 [2024-10-31 21:56:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1741 transitions. [2024-10-31 21:56:23,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 21:56:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1741 transitions. [2024-10-31 21:56:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-31 21:56:23,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:23,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:23,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:56:23,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash -641482011, now seen corresponding path program 1 times [2024-10-31 21:56:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899812213] [2024-10-31 21:56:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:23,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:23,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:23,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 21:56:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:23,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:56:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:23,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:56:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:23,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:56:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:23,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:56:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:23,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:56:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:23,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:23,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899812213] [2024-10-31 21:56:23,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899812213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:23,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:23,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:56:23,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203647539] [2024-10-31 21:56:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:23,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:56:23,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:23,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:56:23,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:56:23,653 INFO L87 Difference]: Start difference. First operand 1258 states and 1741 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 21:56:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:24,935 INFO L93 Difference]: Finished difference Result 3143 states and 4263 transitions. [2024-10-31 21:56:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 21:56:24,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2024-10-31 21:56:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:24,947 INFO L225 Difference]: With dead ends: 3143 [2024-10-31 21:56:24,947 INFO L226 Difference]: Without dead ends: 2273 [2024-10-31 21:56:24,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-31 21:56:24,950 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 2068 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:24,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2103 Valid, 1088 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 21:56:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2024-10-31 21:56:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2107. [2024-10-31 21:56:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1689 states have (on average 1.3433984606275904) internal successors, (2269), 1716 states have internal predecessors, (2269), 232 states have call successors, (232), 135 states have call predecessors, (232), 184 states have return successors, (363), 262 states have call predecessors, (363), 230 states have call successors, (363) [2024-10-31 21:56:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2864 transitions. [2024-10-31 21:56:25,143 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2864 transitions. Word has length 67 [2024-10-31 21:56:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:25,144 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 2864 transitions. [2024-10-31 21:56:25,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 21:56:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2864 transitions. [2024-10-31 21:56:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-31 21:56:25,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:25,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:25,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:56:25,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:25,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1167687639, now seen corresponding path program 1 times [2024-10-31 21:56:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:25,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456743290] [2024-10-31 21:56:25,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 21:56:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:56:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:25,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:56:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:56:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:56:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:56:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:25,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456743290] [2024-10-31 21:56:25,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456743290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:25,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:25,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:56:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172127191] [2024-10-31 21:56:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:25,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:56:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:25,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:56:25,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:56:25,247 INFO L87 Difference]: Start difference. First operand 2107 states and 2864 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 21:56:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:26,247 INFO L93 Difference]: Finished difference Result 3830 states and 5220 transitions. [2024-10-31 21:56:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:56:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-10-31 21:56:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:26,255 INFO L225 Difference]: With dead ends: 3830 [2024-10-31 21:56:26,256 INFO L226 Difference]: Without dead ends: 365 [2024-10-31 21:56:26,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:56:26,278 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 1545 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:26,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 1029 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 21:56:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-31 21:56:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-10-31 21:56:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 333 states have (on average 1.5525525525525525) internal successors, (517), 334 states have internal predecessors, (517), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-31 21:56:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 567 transitions. [2024-10-31 21:56:26,337 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 567 transitions. Word has length 68 [2024-10-31 21:56:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:26,338 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 567 transitions. [2024-10-31 21:56:26,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 21:56:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 567 transitions. [2024-10-31 21:56:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-31 21:56:26,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:26,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:26,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:56:26,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1288529305, now seen corresponding path program 1 times [2024-10-31 21:56:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894429912] [2024-10-31 21:56:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:26,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:56:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-31 21:56:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:26,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-31 21:56:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-31 21:56:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:26,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894429912] [2024-10-31 21:56:26,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894429912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:26,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:56:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519004507] [2024-10-31 21:56:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:26,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:56:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:26,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:56:26,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:56:26,650 INFO L87 Difference]: Start difference. First operand 365 states and 567 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-31 21:56:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:28,776 INFO L93 Difference]: Finished difference Result 848 states and 1339 transitions. [2024-10-31 21:56:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:56:28,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-10-31 21:56:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:28,781 INFO L225 Difference]: With dead ends: 848 [2024-10-31 21:56:28,782 INFO L226 Difference]: Without dead ends: 496 [2024-10-31 21:56:28,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:56:28,784 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 969 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:28,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 724 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-31 21:56:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-31 21:56:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 365. [2024-10-31 21:56:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 333 states have (on average 1.5495495495495495) internal successors, (516), 334 states have internal predecessors, (516), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-31 21:56:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 566 transitions. [2024-10-31 21:56:28,816 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 566 transitions. Word has length 167 [2024-10-31 21:56:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:28,816 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 566 transitions. [2024-10-31 21:56:28,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-31 21:56:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 566 transitions. [2024-10-31 21:56:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-31 21:56:28,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:28,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:28,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:56:28,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:56:28,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 116662373, now seen corresponding path program 1 times [2024-10-31 21:56:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:28,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612071304] [2024-10-31 21:56:28,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 21:56:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:56:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-31 21:56:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-31 21:56:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-31 21:56:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612071304] [2024-10-31 21:56:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612071304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:29,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:29,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:56:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365154285] [2024-10-31 21:56:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:29,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:56:29,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:29,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:56:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:56:29,174 INFO L87 Difference]: Start difference. First operand 365 states and 566 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)