./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu --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 ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:47:12,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:47:12,681 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:47:12,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:47:12,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:47:12,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:47:12,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:47:12,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:47:12,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:47:12,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:47:12,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:47:12,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:47:12,714 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:47:12,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:47:12,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:47:12,716 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:47:12,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:47:12,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:47:12,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:47:12,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:47:12,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:47:12,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:47:12,720 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:47:12,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:47:12,720 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:47:12,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:47:12,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:47:12,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:47:12,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:12,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:47:12,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:47:12,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:47:12,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:47:12,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:47:12,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:47:12,725 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:47:12,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:47:12,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:47:12,726 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:47:12,727 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_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/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_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu 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 -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2023-11-19 07:47:12,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:47:12,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:47:13,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:47:13,001 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:47:13,002 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:47:13,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2023-11-19 07:47:16,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:47:16,478 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:47:16,479 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/sv-benchmarks/c/systemc/transmitter.01.cil.c [2023-11-19 07:47:16,491 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/data/2f13e9904/a9fb6f64e8b64964b096e8063295b1a4/FLAG893b43220 [2023-11-19 07:47:16,513 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/data/2f13e9904/a9fb6f64e8b64964b096e8063295b1a4 [2023-11-19 07:47:16,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:47:16,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:47:16,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:16,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:47:16,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:47:16,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:16,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467fe8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16, skipping insertion in model container [2023-11-19 07:47:16,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:16,568 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:47:16,811 WARN L240 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_0567392b-6efb-49b5-af8e-14c70696d333/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2023-11-19 07:47:16,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:16,923 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:47:16,936 WARN L240 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_0567392b-6efb-49b5-af8e-14c70696d333/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2023-11-19 07:47:16,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:16,996 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:47:16,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16 WrapperNode [2023-11-19 07:47:16,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:16,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:16,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:47:16,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:47:17,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,047 INFO L138 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 212 [2023-11-19 07:47:17,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:17,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:47:17,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:47:17,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:47:17,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:47:17,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:47:17,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:47:17,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:47:17,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (1/1) ... [2023-11-19 07:47:17,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:17,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:47:17,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:47:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:47:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-19 07:47:17,180 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-19 07:47:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-19 07:47:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-19 07:47:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-19 07:47:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-19 07:47:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-19 07:47:17,182 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-19 07:47:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:47:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-19 07:47:17,182 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-19 07:47:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:47:17,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:47:17,285 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:47:17,288 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:47:17,585 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:47:17,597 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:47:17,597 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-19 07:47:17,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:17 BoogieIcfgContainer [2023-11-19 07:47:17,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:47:17,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:47:17,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:47:17,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:47:17,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:47:16" (1/3) ... [2023-11-19 07:47:17,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f4f99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:17, skipping insertion in model container [2023-11-19 07:47:17,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:16" (2/3) ... [2023-11-19 07:47:17,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f4f99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:17, skipping insertion in model container [2023-11-19 07:47:17,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:17" (3/3) ... [2023-11-19 07:47:17,640 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2023-11-19 07:47:17,661 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:47:17,661 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:47:17,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:47:17,720 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2c423a79, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:47:17,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:47:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 84 states have internal predecessors, (124), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-19 07:47:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:47:17,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:17,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:17,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:17,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:17,746 INFO L85 PathProgramCache]: Analyzing trace with hash 570033615, now seen corresponding path program 1 times [2023-11-19 07:47:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:17,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301451765] [2023-11-19 07:47:17,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:17,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301451765] [2023-11-19 07:47:18,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301451765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:18,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:18,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405554667] [2023-11-19 07:47:18,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:18,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:18,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:18,447 INFO L87 Difference]: Start difference. First operand has 102 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 84 states have internal predecessors, (124), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-11-19 07:47:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:18,946 INFO L93 Difference]: Finished difference Result 214 states and 322 transitions. [2023-11-19 07:47:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:47:18,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) Word has length 55 [2023-11-19 07:47:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:18,964 INFO L225 Difference]: With dead ends: 214 [2023-11-19 07:47:18,964 INFO L226 Difference]: Without dead ends: 117 [2023-11-19 07:47:18,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:47:18,973 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 209 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:18,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 328 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-19 07:47:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2023-11-19 07:47:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 79 states have internal predecessors, (107), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-19 07:47:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2023-11-19 07:47:19,030 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 55 [2023-11-19 07:47:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:19,030 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2023-11-19 07:47:19,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-11-19 07:47:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2023-11-19 07:47:19,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:47:19,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:19,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:19,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:47:19,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:19,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash -327359663, now seen corresponding path program 1 times [2023-11-19 07:47:19,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:19,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979984869] [2023-11-19 07:47:19,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:19,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979984869] [2023-11-19 07:47:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979984869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:19,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:19,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:19,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682581926] [2023-11-19 07:47:19,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:19,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:19,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:19,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:19,307 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-11-19 07:47:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:20,121 INFO L93 Difference]: Finished difference Result 340 states and 483 transitions. [2023-11-19 07:47:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:47:20,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) Word has length 55 [2023-11-19 07:47:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:20,133 INFO L225 Difference]: With dead ends: 340 [2023-11-19 07:47:20,133 INFO L226 Difference]: Without dead ends: 252 [2023-11-19 07:47:20,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:47:20,146 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 347 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:20,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 612 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:47:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-19 07:47:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 179. [2023-11-19 07:47:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 144 states have (on average 1.3819444444444444) internal successors, (199), 147 states have internal predecessors, (199), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2023-11-19 07:47:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 250 transitions. [2023-11-19 07:47:20,217 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 250 transitions. Word has length 55 [2023-11-19 07:47:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:20,217 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 250 transitions. [2023-11-19 07:47:20,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-11-19 07:47:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 250 transitions. [2023-11-19 07:47:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:47:20,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:20,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:20,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:47:20,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:20,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:20,223 INFO L85 PathProgramCache]: Analyzing trace with hash -79213169, now seen corresponding path program 1 times [2023-11-19 07:47:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:20,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129968154] [2023-11-19 07:47:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:20,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:20,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:20,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129968154] [2023-11-19 07:47:20,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129968154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:20,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:20,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:47:20,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524480155] [2023-11-19 07:47:20,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:20,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:47:20,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:20,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:47:20,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:20,385 INFO L87 Difference]: Start difference. First operand 179 states and 250 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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) [2023-11-19 07:47:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:20,902 INFO L93 Difference]: Finished difference Result 467 states and 654 transitions. [2023-11-19 07:47:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:47:20,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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) Word has length 55 [2023-11-19 07:47:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:20,906 INFO L225 Difference]: With dead ends: 467 [2023-11-19 07:47:20,907 INFO L226 Difference]: Without dead ends: 299 [2023-11-19 07:47:20,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:47:20,909 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 358 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:20,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 461 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:47:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-19 07:47:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2023-11-19 07:47:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 201 states have (on average 1.36318407960199) internal successors, (274), 205 states have internal predecessors, (274), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2023-11-19 07:47:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 343 transitions. [2023-11-19 07:47:20,966 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 343 transitions. Word has length 55 [2023-11-19 07:47:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:20,967 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 343 transitions. [2023-11-19 07:47:20,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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) [2023-11-19 07:47:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 343 transitions. [2023-11-19 07:47:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:47:20,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:20,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:20,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:47:20,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:20,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1046046800, now seen corresponding path program 1 times [2023-11-19 07:47:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26048171] [2023-11-19 07:47:20,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:20,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:21,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:21,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26048171] [2023-11-19 07:47:21,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26048171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270002348] [2023-11-19 07:47:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:21,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:21,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:21,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:21,120 INFO L87 Difference]: Start difference. First operand 250 states and 343 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-11-19 07:47:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:21,548 INFO L93 Difference]: Finished difference Result 531 states and 743 transitions. [2023-11-19 07:47:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:47:21,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) Word has length 55 [2023-11-19 07:47:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:21,554 INFO L225 Difference]: With dead ends: 531 [2023-11-19 07:47:21,555 INFO L226 Difference]: Without dead ends: 292 [2023-11-19 07:47:21,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:47:21,566 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 144 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:21,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 440 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-11-19 07:47:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 253. [2023-11-19 07:47:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 204 states have (on average 1.3480392156862746) internal successors, (275), 208 states have internal predecessors, (275), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2023-11-19 07:47:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 344 transitions. [2023-11-19 07:47:21,604 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 344 transitions. Word has length 55 [2023-11-19 07:47:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:21,605 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 344 transitions. [2023-11-19 07:47:21,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-11-19 07:47:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 344 transitions. [2023-11-19 07:47:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:47:21,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:21,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:21,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:47:21,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:21,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:21,609 INFO L85 PathProgramCache]: Analyzing trace with hash 973660242, now seen corresponding path program 1 times [2023-11-19 07:47:21,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:21,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584060357] [2023-11-19 07:47:21,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:21,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584060357] [2023-11-19 07:47:21,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584060357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:21,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625597783] [2023-11-19 07:47:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:21,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:21,719 INFO L87 Difference]: Start difference. First operand 253 states and 344 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-11-19 07:47:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:22,138 INFO L93 Difference]: Finished difference Result 543 states and 755 transitions. [2023-11-19 07:47:22,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:47:22,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) Word has length 55 [2023-11-19 07:47:22,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:22,142 INFO L225 Difference]: With dead ends: 543 [2023-11-19 07:47:22,143 INFO L226 Difference]: Without dead ends: 301 [2023-11-19 07:47:22,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:47:22,145 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 115 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:22,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 435 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-11-19 07:47:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 262. [2023-11-19 07:47:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.3333333333333333) internal successors, (284), 217 states have internal predecessors, (284), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2023-11-19 07:47:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2023-11-19 07:47:22,181 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 55 [2023-11-19 07:47:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:22,182 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2023-11-19 07:47:22,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-11-19 07:47:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2023-11-19 07:47:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:47:22,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:22,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:22,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:47:22,189 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:22,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1398079020, now seen corresponding path program 1 times [2023-11-19 07:47:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065056381] [2023-11-19 07:47:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065056381] [2023-11-19 07:47:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065056381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:22,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128586710] [2023-11-19 07:47:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:22,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:22,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:22,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:22,373 INFO L87 Difference]: Start difference. First operand 262 states and 353 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:22,843 INFO L93 Difference]: Finished difference Result 668 states and 901 transitions. [2023-11-19 07:47:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:47:22,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-19 07:47:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:22,847 INFO L225 Difference]: With dead ends: 668 [2023-11-19 07:47:22,848 INFO L226 Difference]: Without dead ends: 486 [2023-11-19 07:47:22,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:47:22,850 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 380 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:22,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 351 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-11-19 07:47:22,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 421. [2023-11-19 07:47:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 347 states have (on average 1.319884726224784) internal successors, (458), 353 states have internal predecessors, (458), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2023-11-19 07:47:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 553 transitions. [2023-11-19 07:47:22,887 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 553 transitions. Word has length 55 [2023-11-19 07:47:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:22,888 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 553 transitions. [2023-11-19 07:47:22,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 553 transitions. [2023-11-19 07:47:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:47:22,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:22,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:22,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:47:22,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:22,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1091449942, now seen corresponding path program 1 times [2023-11-19 07:47:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:22,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398040176] [2023-11-19 07:47:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:22,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:23,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:23,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398040176] [2023-11-19 07:47:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398040176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064644064] [2023-11-19 07:47:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:23,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:23,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:23,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:23,056 INFO L87 Difference]: Start difference. First operand 421 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:23,330 INFO L93 Difference]: Finished difference Result 868 states and 1146 transitions. [2023-11-19 07:47:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:47:23,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-19 07:47:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:23,335 INFO L225 Difference]: With dead ends: 868 [2023-11-19 07:47:23,335 INFO L226 Difference]: Without dead ends: 458 [2023-11-19 07:47:23,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:47:23,337 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 234 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:23,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 306 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-11-19 07:47:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 420. [2023-11-19 07:47:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 346 states have (on average 1.2861271676300579) internal successors, (445), 352 states have internal predecessors, (445), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2023-11-19 07:47:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 540 transitions. [2023-11-19 07:47:23,389 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 540 transitions. Word has length 55 [2023-11-19 07:47:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:23,393 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 540 transitions. [2023-11-19 07:47:23,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 540 transitions. [2023-11-19 07:47:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:47:23,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:23,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:23,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:47:23,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:23,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1310304660, now seen corresponding path program 1 times [2023-11-19 07:47:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259640927] [2023-11-19 07:47:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:23,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259640927] [2023-11-19 07:47:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259640927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:47:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047250250] [2023-11-19 07:47:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:23,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:47:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:47:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:23,521 INFO L87 Difference]: Start difference. First operand 420 states and 540 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:23,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:23,978 INFO L93 Difference]: Finished difference Result 1275 states and 1659 transitions. [2023-11-19 07:47:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:47:23,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-19 07:47:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:23,986 INFO L225 Difference]: With dead ends: 1275 [2023-11-19 07:47:23,986 INFO L226 Difference]: Without dead ends: 866 [2023-11-19 07:47:23,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:47:23,989 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 283 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:23,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 366 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2023-11-19 07:47:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 804. [2023-11-19 07:47:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 661 states have (on average 1.2692889561270801) internal successors, (839), 672 states have internal predecessors, (839), 85 states have call successors, (85), 50 states have call predecessors, (85), 57 states have return successors, (113), 85 states have call predecessors, (113), 85 states have call successors, (113) [2023-11-19 07:47:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1037 transitions. [2023-11-19 07:47:24,075 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1037 transitions. Word has length 55 [2023-11-19 07:47:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:24,075 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1037 transitions. [2023-11-19 07:47:24,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1037 transitions. [2023-11-19 07:47:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-19 07:47:24,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:24,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:24,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:47:24,078 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:24,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 970501815, now seen corresponding path program 1 times [2023-11-19 07:47:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:24,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57123499] [2023-11-19 07:47:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:24,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57123499] [2023-11-19 07:47:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57123499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203890806] [2023-11-19 07:47:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:24,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:24,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:24,134 INFO L87 Difference]: Start difference. First operand 804 states and 1037 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 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) [2023-11-19 07:47:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:24,389 INFO L93 Difference]: Finished difference Result 1467 states and 1870 transitions. [2023-11-19 07:47:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:47:24,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 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 56 [2023-11-19 07:47:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:24,394 INFO L225 Difference]: With dead ends: 1467 [2023-11-19 07:47:24,395 INFO L226 Difference]: Without dead ends: 674 [2023-11-19 07:47:24,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:24,399 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 227 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:24,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 193 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2023-11-19 07:47:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 618. [2023-11-19 07:47:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 515 states have (on average 1.2563106796116505) internal successors, (647), 523 states have internal predecessors, (647), 60 states have call successors, (60), 37 states have call predecessors, (60), 42 states have return successors, (75), 59 states have call predecessors, (75), 60 states have call successors, (75) [2023-11-19 07:47:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 782 transitions. [2023-11-19 07:47:24,462 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 782 transitions. Word has length 56 [2023-11-19 07:47:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:24,462 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 782 transitions. [2023-11-19 07:47:24,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 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) [2023-11-19 07:47:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 782 transitions. [2023-11-19 07:47:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:24,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:24,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:24,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:47:24,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:24,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1391020897, now seen corresponding path program 1 times [2023-11-19 07:47:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:24,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811170662] [2023-11-19 07:47:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:24,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:24,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811170662] [2023-11-19 07:47:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811170662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:24,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:24,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413489131] [2023-11-19 07:47:24,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:24,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:24,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:24,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:24,561 INFO L87 Difference]: Start difference. First operand 618 states and 782 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 07:47:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:24,942 INFO L93 Difference]: Finished difference Result 1868 states and 2358 transitions. [2023-11-19 07:47:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:47:24,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2023-11-19 07:47:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:24,951 INFO L225 Difference]: With dead ends: 1868 [2023-11-19 07:47:24,951 INFO L226 Difference]: Without dead ends: 1260 [2023-11-19 07:47:24,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:47:24,954 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 282 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:24,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 251 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2023-11-19 07:47:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1154. [2023-11-19 07:47:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 953 states have (on average 1.229800629590766) internal successors, (1172), 968 states have internal predecessors, (1172), 116 states have call successors, (116), 74 states have call predecessors, (116), 84 states have return successors, (145), 113 states have call predecessors, (145), 116 states have call successors, (145) [2023-11-19 07:47:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1433 transitions. [2023-11-19 07:47:25,059 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1433 transitions. Word has length 57 [2023-11-19 07:47:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:25,060 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1433 transitions. [2023-11-19 07:47:25,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 07:47:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1433 transitions. [2023-11-19 07:47:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-19 07:47:25,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:25,062 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:25,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:47:25,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:25,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:25,063 INFO L85 PathProgramCache]: Analyzing trace with hash 802104282, now seen corresponding path program 1 times [2023-11-19 07:47:25,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:25,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230076999] [2023-11-19 07:47:25,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:25,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:47:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:47:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:47:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:47:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:47:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:47:25,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:25,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230076999] [2023-11-19 07:47:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230076999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:25,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:25,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:47:25,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938036885] [2023-11-19 07:47:25,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:25,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:47:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:25,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:47:25,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:25,152 INFO L87 Difference]: Start difference. First operand 1154 states and 1433 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 07:47:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:25,929 INFO L93 Difference]: Finished difference Result 3549 states and 4417 transitions. [2023-11-19 07:47:25,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:47:25,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 76 [2023-11-19 07:47:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:25,942 INFO L225 Difference]: With dead ends: 3549 [2023-11-19 07:47:25,942 INFO L226 Difference]: Without dead ends: 1851 [2023-11-19 07:47:25,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:47:25,948 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 492 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:25,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 510 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:47:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2023-11-19 07:47:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1744. [2023-11-19 07:47:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1436 states have (on average 1.217966573816156) internal successors, (1749), 1467 states have internal predecessors, (1749), 172 states have call successors, (172), 111 states have call predecessors, (172), 135 states have return successors, (252), 167 states have call predecessors, (252), 172 states have call successors, (252) [2023-11-19 07:47:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2173 transitions. [2023-11-19 07:47:26,107 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2173 transitions. Word has length 76 [2023-11-19 07:47:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:26,107 INFO L495 AbstractCegarLoop]: Abstraction has 1744 states and 2173 transitions. [2023-11-19 07:47:26,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 07:47:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2173 transitions. [2023-11-19 07:47:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-19 07:47:26,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:26,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:26,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:47:26,111 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:26,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1940125613, now seen corresponding path program 1 times [2023-11-19 07:47:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:26,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435563829] [2023-11-19 07:47:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:47:26,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:47:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:47:26,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:47:26,169 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:47:26,170 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:47:26,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:47:26,175 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:26,180 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:47:26,224 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-19 07:47:26,232 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-19 07:47:26,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:47:26 BoogieIcfgContainer [2023-11-19 07:47:26,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:47:26,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:47:26,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:47:26,281 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:47:26,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:17" (3/4) ... [2023-11-19 07:47:26,282 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:47:26,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-19 07:47:26,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-19 07:47:26,382 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:47:26,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:47:26,383 INFO L158 Benchmark]: Toolchain (without parser) took 9860.53ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 103.4MB in the beginning and 136.9MB in the end (delta: -33.5MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2023-11-19 07:47:26,383 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 107.0MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:47:26,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.87ms. Allocated memory is still 144.7MB. Free memory was 103.4MB in the beginning and 90.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:47:26,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.12ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 88.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:47:26,384 INFO L158 Benchmark]: Boogie Preprocessor took 35.64ms. Allocated memory is still 144.7MB. Free memory was 88.2MB in the beginning and 86.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:47:26,385 INFO L158 Benchmark]: RCFGBuilder took 542.68ms. Allocated memory is still 144.7MB. Free memory was 86.6MB in the beginning and 115.2MB in the end (delta: -28.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2023-11-19 07:47:26,385 INFO L158 Benchmark]: TraceAbstraction took 8646.17ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 114.3MB in the beginning and 143.2MB in the end (delta: -28.8MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2023-11-19 07:47:26,385 INFO L158 Benchmark]: Witness Printer took 101.63ms. Allocated memory is still 213.9MB. Free memory was 143.2MB in the beginning and 136.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:47:26,387 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 107.0MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.87ms. Allocated memory is still 144.7MB. Free memory was 103.4MB in the beginning and 90.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.12ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 88.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.64ms. Allocated memory is still 144.7MB. Free memory was 88.2MB in the beginning and 86.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.68ms. Allocated memory is still 144.7MB. Free memory was 86.6MB in the beginning and 115.2MB in the end (delta: -28.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8646.17ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 114.3MB in the beginning and 143.2MB in the end (delta: -28.8MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 101.63ms. Allocated memory is still 213.9MB. Free memory was 143.2MB in the beginning and 136.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; VAL [E_1=2, M_E=2, T1_E=2, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0] [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L400] RET activate_threads() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \result=1, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L211-L222] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE, EXPR \read(tmp_ndt_2) [L230] EXPR t1_st = 1 [L231] CALL, EXPR transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L231] RET, EXPR transmit1() [L225-L236] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \result=1, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE, EXPR \read(tmp_ndt_1) [L216] EXPR m_st = 1 [L217] CALL, EXPR master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L55] E_1 = 1 [L56] CALL immediate_notify() [L322] CALL activate_threads() VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L322] RET activate_threads() VAL [E_1=1, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET, EXPR master() [L211-L222] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L101] CALL error() [L21] reach_error() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3178 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3071 mSDsluCounter, 4253 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3079 mSDsCounter, 493 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3476 IncrementalHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 493 mSolverCounterUnsat, 1174 mSDtfsCounter, 3476 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1744occurred in iteration=11, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 654 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 727 NumberOfCodeBlocks, 727 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 07:47:26,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0567392b-6efb-49b5-af8e-14c70696d333/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE