./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB --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.3.0-dev-d790fec [2024-11-27 23:29:59,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:29:59,224 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:29:59,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:29:59,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:29:59,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:29:59,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:29:59,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:29:59,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:29:59,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:29:59,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:29:59,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:29:59,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:29:59,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:29:59,268 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:29:59,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:29:59,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:29:59,268 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:29:59,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:29:59,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:29:59,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:29:59,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:29:59,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:29:59,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:29:59,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:29:59,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:29:59,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:29:59,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:29:59,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:29:59,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:29:59,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:29:59,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:29:59,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:29:59,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:29:59,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:29:59,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:29:59,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:29:59,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:29:59,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:29:59,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB 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 [2024-11-27 23:29:59,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:29:59,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:29:59,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:29:59,596 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:29:59,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:29:59,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2024-11-27 23:30:02,605 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/data/7196bbe2c/d7b7c5e479a24066955510a984260c8d/FLAGb50b802f0 [2024-11-27 23:30:02,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:30:02,887 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/sv-benchmarks/c/systemc/transmitter.01.cil.c [2024-11-27 23:30:02,898 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/data/7196bbe2c/d7b7c5e479a24066955510a984260c8d/FLAGb50b802f0 [2024-11-27 23:30:03,183 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/data/7196bbe2c/d7b7c5e479a24066955510a984260c8d [2024-11-27 23:30:03,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:30:03,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:30:03,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:30:03,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:30:03,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:30:03,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41eb8e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03, skipping insertion in model container [2024-11-27 23:30:03,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:30:03,393 WARN L250 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_f461b9c5-911b-4bb9-93d1-35c83e9433ee/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2024-11-27 23:30:03,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:30:03,481 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:30:03,491 WARN L250 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_f461b9c5-911b-4bb9-93d1-35c83e9433ee/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2024-11-27 23:30:03,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:30:03,529 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:30:03,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03 WrapperNode [2024-11-27 23:30:03,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:30:03,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:30:03,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:30:03,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:30:03,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,566 INFO L138 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 207 [2024-11-27 23:30:03,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:30:03,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:30:03,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:30:03,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:30:03,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,589 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 23:30:03,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:30:03,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:30:03,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:30:03,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:30:03,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (1/1) ... [2024-11-27 23:30:03,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:03,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:03,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:30:03,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:30:03,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:30:03,687 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-27 23:30:03,687 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-27 23:30:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-27 23:30:03,688 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-27 23:30:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-27 23:30:03,688 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-27 23:30:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-27 23:30:03,688 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-27 23:30:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:30:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-27 23:30:03,688 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-27 23:30:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:30:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:30:03,758 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:30:03,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:30:04,150 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-27 23:30:04,151 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:30:04,164 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:30:04,164 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-27 23:30:04,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:04 BoogieIcfgContainer [2024-11-27 23:30:04,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:30:04,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:30:04,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:30:04,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:30:04,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:30:03" (1/3) ... [2024-11-27 23:30:04,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58705ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:30:04, skipping insertion in model container [2024-11-27 23:30:04,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:03" (2/3) ... [2024-11-27 23:30:04,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58705ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:30:04, skipping insertion in model container [2024-11-27 23:30:04,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:04" (3/3) ... [2024-11-27 23:30:04,179 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2024-11-27 23:30:04,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:30:04,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.01.cil.c that has 6 procedures, 97 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-27 23:30:04,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:30:04,288 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@32f3444f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:30:04,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:30:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 79 states have internal predecessors, (119), 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) [2024-11-27 23:30:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 23:30:04,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:04,304 INFO L218 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] [2024-11-27 23:30:04,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:04,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:04,309 INFO L85 PathProgramCache]: Analyzing trace with hash -358835280, now seen corresponding path program 1 times [2024-11-27 23:30:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703404778] [2024-11-27 23:30:04,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:04,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:04,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703404778] [2024-11-27 23:30:04,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703404778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:04,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:04,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:30:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622137549] [2024-11-27 23:30:04,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:04,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:30:04,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:04,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:30:04,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:30:04,939 INFO L87 Difference]: Start difference. First operand has 97 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 79 states have internal predecessors, (119), 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 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:05,566 INFO L93 Difference]: Finished difference Result 302 states and 463 transitions. [2024-11-27 23:30:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:30:05,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 53 [2024-11-27 23:30:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:05,579 INFO L225 Difference]: With dead ends: 302 [2024-11-27 23:30:05,579 INFO L226 Difference]: Without dead ends: 206 [2024-11-27 23:30:05,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:30:05,586 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 257 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:05,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 625 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 23:30:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-27 23:30:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 173. [2024-11-27 23:30:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 137 states have (on average 1.4233576642335766) internal successors, (195), 140 states have internal predecessors, (195), 23 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2024-11-27 23:30:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 248 transitions. [2024-11-27 23:30:05,680 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 248 transitions. Word has length 53 [2024-11-27 23:30:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:05,680 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 248 transitions. [2024-11-27 23:30:05,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 248 transitions. [2024-11-27 23:30:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 23:30:05,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:05,683 INFO L218 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] [2024-11-27 23:30:05,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:30:05,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:05,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 64811442, now seen corresponding path program 1 times [2024-11-27 23:30:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:05,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587172303] [2024-11-27 23:30:05,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:05,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587172303] [2024-11-27 23:30:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587172303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:05,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:05,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:30:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327382406] [2024-11-27 23:30:05,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:05,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:30:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:05,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:30:05,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:30:05,915 INFO L87 Difference]: Start difference. First operand 173 states and 248 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:06,498 INFO L93 Difference]: Finished difference Result 540 states and 777 transitions. [2024-11-27 23:30:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:30:06,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 53 [2024-11-27 23:30:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:06,508 INFO L225 Difference]: With dead ends: 540 [2024-11-27 23:30:06,508 INFO L226 Difference]: Without dead ends: 378 [2024-11-27 23:30:06,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:30:06,513 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 245 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:06,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 488 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 23:30:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-27 23:30:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 319. [2024-11-27 23:30:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 255 states have (on average 1.419607843137255) internal successors, (362), 262 states have internal predecessors, (362), 37 states have call successors, (37), 20 states have call predecessors, (37), 26 states have return successors, (60), 40 states have call predecessors, (60), 37 states have call successors, (60) [2024-11-27 23:30:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 459 transitions. [2024-11-27 23:30:06,578 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 459 transitions. Word has length 53 [2024-11-27 23:30:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:06,580 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 459 transitions. [2024-11-27 23:30:06,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 459 transitions. [2024-11-27 23:30:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 23:30:06,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:06,587 INFO L218 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] [2024-11-27 23:30:06,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:30:06,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:06,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1306995856, now seen corresponding path program 1 times [2024-11-27 23:30:06,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:06,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799774156] [2024-11-27 23:30:06,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:06,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:06,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:06,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799774156] [2024-11-27 23:30:06,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799774156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:06,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:06,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:30:06,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780834370] [2024-11-27 23:30:06,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:06,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:30:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:06,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:30:06,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:30:06,696 INFO L87 Difference]: Start difference. First operand 319 states and 459 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:06,902 INFO L93 Difference]: Finished difference Result 774 states and 1115 transitions. [2024-11-27 23:30:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:30:06,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 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 53 [2024-11-27 23:30:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:06,906 INFO L225 Difference]: With dead ends: 774 [2024-11-27 23:30:06,906 INFO L226 Difference]: Without dead ends: 466 [2024-11-27 23:30:06,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:30:06,911 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 204 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:06,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 399 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:30:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-27 23:30:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 452. [2024-11-27 23:30:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 361 states have (on average 1.3905817174515236) internal successors, (502), 370 states have internal predecessors, (502), 52 states have call successors, (52), 30 states have call predecessors, (52), 38 states have return successors, (79), 55 states have call predecessors, (79), 52 states have call successors, (79) [2024-11-27 23:30:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 633 transitions. [2024-11-27 23:30:06,999 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 633 transitions. Word has length 53 [2024-11-27 23:30:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:07,002 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 633 transitions. [2024-11-27 23:30:07,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 633 transitions. [2024-11-27 23:30:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 23:30:07,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:07,007 INFO L218 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] [2024-11-27 23:30:07,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:30:07,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash -255546767, now seen corresponding path program 1 times [2024-11-27 23:30:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795717670] [2024-11-27 23:30:07,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795717670] [2024-11-27 23:30:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795717670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:07,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:30:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241447338] [2024-11-27 23:30:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:30:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:30:07,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:07,114 INFO L87 Difference]: Start difference. First operand 452 states and 633 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:07,191 INFO L93 Difference]: Finished difference Result 899 states and 1268 transitions. [2024-11-27 23:30:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:30:07,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 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 53 [2024-11-27 23:30:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:07,195 INFO L225 Difference]: With dead ends: 899 [2024-11-27 23:30:07,197 INFO L226 Difference]: Without dead ends: 458 [2024-11-27 23:30:07,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:07,200 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:07,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-27 23:30:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2024-11-27 23:30:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 367 states have (on average 1.3732970027247957) internal successors, (504), 376 states have internal predecessors, (504), 52 states have call successors, (52), 30 states have call predecessors, (52), 38 states have return successors, (79), 55 states have call predecessors, (79), 52 states have call successors, (79) [2024-11-27 23:30:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 635 transitions. [2024-11-27 23:30:07,273 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 635 transitions. Word has length 53 [2024-11-27 23:30:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:07,275 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 635 transitions. [2024-11-27 23:30:07,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 635 transitions. [2024-11-27 23:30:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 23:30:07,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:07,278 INFO L218 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] [2024-11-27 23:30:07,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:30:07,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 446053107, now seen corresponding path program 1 times [2024-11-27 23:30:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672412016] [2024-11-27 23:30:07,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:07,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:07,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672412016] [2024-11-27 23:30:07,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672412016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:07,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:07,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:30:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369534998] [2024-11-27 23:30:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:07,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:30:07,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:07,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:30:07,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:07,386 INFO L87 Difference]: Start difference. First operand 458 states and 635 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:07,452 INFO L93 Difference]: Finished difference Result 923 states and 1288 transitions. [2024-11-27 23:30:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:30:07,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 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 53 [2024-11-27 23:30:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:07,457 INFO L225 Difference]: With dead ends: 923 [2024-11-27 23:30:07,457 INFO L226 Difference]: Without dead ends: 476 [2024-11-27 23:30:07,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:07,460 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:07,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-27 23:30:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2024-11-27 23:30:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 385 states have (on average 1.3558441558441559) internal successors, (522), 394 states have internal predecessors, (522), 52 states have call successors, (52), 30 states have call predecessors, (52), 38 states have return successors, (79), 55 states have call predecessors, (79), 52 states have call successors, (79) [2024-11-27 23:30:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 653 transitions. [2024-11-27 23:30:07,510 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 653 transitions. Word has length 53 [2024-11-27 23:30:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:07,511 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 653 transitions. [2024-11-27 23:30:07,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 653 transitions. [2024-11-27 23:30:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 23:30:07,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:07,513 INFO L218 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] [2024-11-27 23:30:07,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:30:07,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:07,514 INFO L85 PathProgramCache]: Analyzing trace with hash 586601717, now seen corresponding path program 1 times [2024-11-27 23:30:07,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:07,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712036931] [2024-11-27 23:30:07,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712036931] [2024-11-27 23:30:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712036931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:07,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:30:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997590261] [2024-11-27 23:30:07,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:07,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:30:07,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:07,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:30:07,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:07,635 INFO L87 Difference]: Start difference. First operand 476 states and 653 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:08,024 INFO L93 Difference]: Finished difference Result 906 states and 1237 transitions. [2024-11-27 23:30:08,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:30:08,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 53 [2024-11-27 23:30:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:08,029 INFO L225 Difference]: With dead ends: 906 [2024-11-27 23:30:08,029 INFO L226 Difference]: Without dead ends: 648 [2024-11-27 23:30:08,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:30:08,031 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 192 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:08,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 311 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:30:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-27 23:30:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 615. [2024-11-27 23:30:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 501 states have (on average 1.3273453093812375) internal successors, (665), 510 states have internal predecessors, (665), 65 states have call successors, (65), 40 states have call predecessors, (65), 48 states have return successors, (84), 68 states have call predecessors, (84), 65 states have call successors, (84) [2024-11-27 23:30:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 814 transitions. [2024-11-27 23:30:08,110 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 814 transitions. Word has length 53 [2024-11-27 23:30:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:08,110 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 814 transitions. [2024-11-27 23:30:08,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 814 transitions. [2024-11-27 23:30:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 23:30:08,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:08,111 INFO L218 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] [2024-11-27 23:30:08,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:30:08,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:08,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1009303543, now seen corresponding path program 1 times [2024-11-27 23:30:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156708397] [2024-11-27 23:30:08,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:08,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156708397] [2024-11-27 23:30:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156708397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:08,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:08,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:30:08,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839328090] [2024-11-27 23:30:08,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:08,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:30:08,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:08,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:30:08,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:30:08,285 INFO L87 Difference]: Start difference. First operand 615 states and 814 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:08,757 INFO L93 Difference]: Finished difference Result 982 states and 1299 transitions. [2024-11-27 23:30:08,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:30:08,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 53 [2024-11-27 23:30:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:08,765 INFO L225 Difference]: With dead ends: 982 [2024-11-27 23:30:08,766 INFO L226 Difference]: Without dead ends: 587 [2024-11-27 23:30:08,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:30:08,769 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 203 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:08,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 381 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 23:30:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-27 23:30:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 536. [2024-11-27 23:30:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 439 states have (on average 1.3211845102505695) internal successors, (580), 443 states have internal predecessors, (580), 58 states have call successors, (58), 35 states have call predecessors, (58), 38 states have return successors, (63), 59 states have call predecessors, (63), 58 states have call successors, (63) [2024-11-27 23:30:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 701 transitions. [2024-11-27 23:30:08,840 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 701 transitions. Word has length 53 [2024-11-27 23:30:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:08,840 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 701 transitions. [2024-11-27 23:30:08,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 701 transitions. [2024-11-27 23:30:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 23:30:08,841 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:08,841 INFO L218 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] [2024-11-27 23:30:08,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:30:08,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:08,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash 191655093, now seen corresponding path program 1 times [2024-11-27 23:30:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321487354] [2024-11-27 23:30:08,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:08,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321487354] [2024-11-27 23:30:08,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321487354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:08,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:08,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:30:08,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002749423] [2024-11-27 23:30:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:08,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:30:08,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:08,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:30:08,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:30:08,929 INFO L87 Difference]: Start difference. First operand 536 states and 701 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:09,220 INFO L93 Difference]: Finished difference Result 1561 states and 2076 transitions. [2024-11-27 23:30:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:30:09,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 53 [2024-11-27 23:30:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:09,230 INFO L225 Difference]: With dead ends: 1561 [2024-11-27 23:30:09,230 INFO L226 Difference]: Without dead ends: 1036 [2024-11-27 23:30:09,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:09,233 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 161 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:09,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 262 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:30:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-11-27 23:30:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1033. [2024-11-27 23:30:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 843 states have (on average 1.3036773428232502) internal successors, (1099), 852 states have internal predecessors, (1099), 112 states have call successors, (112), 70 states have call predecessors, (112), 77 states have return successors, (145), 114 states have call predecessors, (145), 112 states have call successors, (145) [2024-11-27 23:30:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1356 transitions. [2024-11-27 23:30:09,330 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1356 transitions. Word has length 53 [2024-11-27 23:30:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:09,330 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1356 transitions. [2024-11-27 23:30:09,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1356 transitions. [2024-11-27 23:30:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-27 23:30:09,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:09,331 INFO L218 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] [2024-11-27 23:30:09,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:30:09,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:09,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:09,333 INFO L85 PathProgramCache]: Analyzing trace with hash -914720774, now seen corresponding path program 1 times [2024-11-27 23:30:09,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:09,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295171990] [2024-11-27 23:30:09,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:09,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:09,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:09,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295171990] [2024-11-27 23:30:09,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295171990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:09,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:09,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:30:09,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908105354] [2024-11-27 23:30:09,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:09,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:30:09,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:09,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:30:09,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:09,390 INFO L87 Difference]: Start difference. First operand 1033 states and 1356 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:09,485 INFO L93 Difference]: Finished difference Result 1832 states and 2378 transitions. [2024-11-27 23:30:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:30:09,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (5), 1 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 54 [2024-11-27 23:30:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:09,491 INFO L225 Difference]: With dead ends: 1832 [2024-11-27 23:30:09,491 INFO L226 Difference]: Without dead ends: 810 [2024-11-27 23:30:09,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:09,496 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:09,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2024-11-27 23:30:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2024-11-27 23:30:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 671 states have (on average 1.2846497764530551) internal successors, (862), 677 states have internal predecessors, (862), 80 states have call successors, (80), 53 states have call predecessors, (80), 58 states have return successors, (97), 81 states have call predecessors, (97), 80 states have call successors, (97) [2024-11-27 23:30:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1039 transitions. [2024-11-27 23:30:09,581 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1039 transitions. Word has length 54 [2024-11-27 23:30:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:09,582 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1039 transitions. [2024-11-27 23:30:09,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1039 transitions. [2024-11-27 23:30:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-27 23:30:09,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:09,583 INFO L218 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] [2024-11-27 23:30:09,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:30:09,583 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:09,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1470788934, now seen corresponding path program 1 times [2024-11-27 23:30:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101361496] [2024-11-27 23:30:09,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:09,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:09,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101361496] [2024-11-27 23:30:09,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101361496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:09,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:09,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:30:09,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953139922] [2024-11-27 23:30:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:09,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:30:09,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:09,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:30:09,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:09,626 INFO L87 Difference]: Start difference. First operand 810 states and 1039 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 23:30:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:09,788 INFO L93 Difference]: Finished difference Result 2330 states and 2989 transitions. [2024-11-27 23:30:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:30:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 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 55 [2024-11-27 23:30:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:09,800 INFO L225 Difference]: With dead ends: 2330 [2024-11-27 23:30:09,800 INFO L226 Difference]: Without dead ends: 1530 [2024-11-27 23:30:09,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:09,804 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 96 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:09,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-27 23:30:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1520. [2024-11-27 23:30:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1247 states have (on average 1.255813953488372) internal successors, (1566), 1258 states have internal predecessors, (1566), 156 states have call successors, (156), 106 states have call predecessors, (156), 116 states have return successors, (189), 157 states have call predecessors, (189), 156 states have call successors, (189) [2024-11-27 23:30:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1911 transitions. [2024-11-27 23:30:09,975 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1911 transitions. Word has length 55 [2024-11-27 23:30:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:09,976 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1911 transitions. [2024-11-27 23:30:09,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 23:30:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1911 transitions. [2024-11-27 23:30:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-27 23:30:09,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:09,979 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-27 23:30:09,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:30:09,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:09,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:09,980 INFO L85 PathProgramCache]: Analyzing trace with hash 958969164, now seen corresponding path program 1 times [2024-11-27 23:30:09,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:09,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086289258] [2024-11-27 23:30:09,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:09,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:30:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:10,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086289258] [2024-11-27 23:30:10,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086289258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:10,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:10,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:30:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654430455] [2024-11-27 23:30:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:10,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:30:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:10,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:30:10,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:30:10,091 INFO L87 Difference]: Start difference. First operand 1520 states and 1911 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 23:30:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:10,980 INFO L93 Difference]: Finished difference Result 4590 states and 5817 transitions. [2024-11-27 23:30:10,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 23:30:10,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2024-11-27 23:30:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:10,995 INFO L225 Difference]: With dead ends: 4590 [2024-11-27 23:30:10,995 INFO L226 Difference]: Without dead ends: 2369 [2024-11-27 23:30:11,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:30:11,003 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 470 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:11,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 528 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 23:30:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2024-11-27 23:30:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2266. [2024-11-27 23:30:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 1859 states have (on average 1.2431414739107047) internal successors, (2311), 1875 states have internal predecessors, (2311), 232 states have call successors, (232), 159 states have call predecessors, (232), 174 states have return successors, (308), 233 states have call predecessors, (308), 232 states have call successors, (308) [2024-11-27 23:30:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 2851 transitions. [2024-11-27 23:30:11,234 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 2851 transitions. Word has length 72 [2024-11-27 23:30:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:11,235 INFO L471 AbstractCegarLoop]: Abstraction has 2266 states and 2851 transitions. [2024-11-27 23:30:11,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 23:30:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 2851 transitions. [2024-11-27 23:30:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-27 23:30:11,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:11,241 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:11,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 23:30:11,241 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:11,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash -177408155, now seen corresponding path program 1 times [2024-11-27 23:30:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:11,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240370509] [2024-11-27 23:30:11,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:30:11,265 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:30:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:30:11,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:30:11,319 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:30:11,320 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:30:11,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 23:30:11,325 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:11,433 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:30:11,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:30:11 BoogieIcfgContainer [2024-11-27 23:30:11,441 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:30:11,442 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:30:11,442 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:30:11,442 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:30:11,442 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:04" (3/4) ... [2024-11-27 23:30:11,443 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 23:30:11,591 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 68. [2024-11-27 23:30:11,714 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:30:11,714 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:30:11,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:30:11,715 INFO L158 Benchmark]: Toolchain (without parser) took 8527.30ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 92.4MB in the beginning and 147.4MB in the end (delta: -55.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-27 23:30:11,715 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 74.1MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:30:11,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.86ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.2MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:30:11,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:30:11,716 INFO L158 Benchmark]: Boogie Preprocessor took 50.06ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:30:11,716 INFO L158 Benchmark]: RCFGBuilder took 547.66ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 59.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:30:11,716 INFO L158 Benchmark]: TraceAbstraction took 7273.73ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 58.7MB in the beginning and 158.0MB in the end (delta: -99.3MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2024-11-27 23:30:11,717 INFO L158 Benchmark]: Witness Printer took 272.53ms. Allocated memory is still 192.9MB. Free memory was 158.0MB in the beginning and 147.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:30:11,719 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.44ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 74.1MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.86ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.2MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.06ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 547.66ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 59.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7273.73ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 58.7MB in the beginning and 158.0MB in the end (delta: -99.3MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Witness Printer took 272.53ms. Allocated memory is still 192.9MB. Free memory was 158.0MB in the beginning and 147.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 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, 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, 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, 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] [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, 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] [L400] RET activate_threads() 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] [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, 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] [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, 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] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\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] [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 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] [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 transmit1() [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, 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] [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] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE \read(tmp_ndt_1) [L216] m_st = 1 [L217] CALL 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] [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, 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] [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, 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] [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] [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 master() [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, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2000 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1950 mSDsluCounter, 4337 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2883 mSDsCounter, 236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1720 IncrementalHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 236 mSolverCounterUnsat, 1454 mSDtfsCounter, 1720 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2266occurred in iteration=11, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 306 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 697 NumberOfCodeBlocks, 697 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 594 ConstructedInterpolants, 0 QuantifiedInterpolants, 993 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-27 23:30:11,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f461b9c5-911b-4bb9-93d1-35c83e9433ee/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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