./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:01:16,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:01:16,409 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:01:16,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:01:16,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:01:16,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:01:16,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:01:16,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:01:16,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:01:16,465 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:01:16,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:01:16,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:01:16,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:01:16,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:01:16,470 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:01:16,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:01:16,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:01:16,471 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:01:16,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:01:16,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:01:16,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:01:16,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:01:16,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:01:16,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:01:16,475 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:01:16,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:01:16,476 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:01:16,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:01:16,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:01:16,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:01:16,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:01:16,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:01:16,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:01:16,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:01:16,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:01:16,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:01:16,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:01:16,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:01:16,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:01:16,483 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:01:16,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:01:16,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:01:16,484 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2023-11-26 12:01:16,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:01:16,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:01:16,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:01:16,869 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:01:16,870 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:01:16,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2023-11-26 12:01:20,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:01:20,571 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:01:20,572 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/sv-benchmarks/c/systemc/transmitter.01.cil.c [2023-11-26 12:01:20,585 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/data/db6b64973/3ef0011eb8e34262a3174d7d819d10a0/FLAGa2d8993f3 [2023-11-26 12:01:20,605 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/data/db6b64973/3ef0011eb8e34262a3174d7d819d10a0 [2023-11-26 12:01:20,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:01:20,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:01:20,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:01:20,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:01:20,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:01:20,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:20" (1/1) ... [2023-11-26 12:01:20,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3afb21e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:20, skipping insertion in model container [2023-11-26 12:01:20,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:20" (1/1) ... [2023-11-26 12:01:20,665 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:01:20,913 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2023-11-26 12:01:20,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:01:20,980 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:01:21,011 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2023-11-26 12:01:21,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:01:21,065 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:01:21,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21 WrapperNode [2023-11-26 12:01:21,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:01:21,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:01:21,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:01:21,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:01:21,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,117 INFO L138 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 212 [2023-11-26 12:01:21,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:01:21,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:01:21,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:01:21,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:01:21,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,150 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]. [2023-11-26 12:01:21,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:01:21,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:01:21,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:01:21,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:01:21,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (1/1) ... [2023-11-26 12:01:21,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:01:21,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:21,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:21,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:01:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:01:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-26 12:01:21,268 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-26 12:01:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-26 12:01:21,269 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-26 12:01:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-26 12:01:21,269 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-26 12:01:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-26 12:01:21,270 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-26 12:01:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:01:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-26 12:01:21,270 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-26 12:01:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:01:21,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:01:21,376 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:01:21,380 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:01:21,771 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:01:21,827 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:01:21,827 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-26 12:01:21,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:21 BoogieIcfgContainer [2023-11-26 12:01:21,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:01:21,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:01:21,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:01:21,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:01:21,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:01:20" (1/3) ... [2023-11-26 12:01:21,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd0f0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:21, skipping insertion in model container [2023-11-26 12:01:21,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:21" (2/3) ... [2023-11-26 12:01:21,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd0f0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:21, skipping insertion in model container [2023-11-26 12:01:21,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:21" (3/3) ... [2023-11-26 12:01:21,841 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2023-11-26 12:01:21,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:01:21,868 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:01:21,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:01:21,985 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@533ab33e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:01:21,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:01:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 67 states have (on average 1.626865671641791) internal successors, (109), 69 states have internal predecessors, (109), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-26 12:01:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-26 12:01:22,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:22,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:22,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:22,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1028028595, now seen corresponding path program 1 times [2023-11-26 12:01:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:22,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965281591] [2023-11-26 12:01:22,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:22,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:22,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:22,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:22,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:22,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:22,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:22,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965281591] [2023-11-26 12:01:22,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965281591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:22,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:22,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:01:22,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498801460] [2023-11-26 12:01:22,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:22,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:01:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:22,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:01:22,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:01:22,848 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.626865671641791) internal successors, (109), 69 states have internal predecessors, (109), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:24,167 INFO L93 Difference]: Finished difference Result 313 states and 498 transitions. [2023-11-26 12:01:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 12:01:24,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-26 12:01:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:24,187 INFO L225 Difference]: With dead ends: 313 [2023-11-26 12:01:24,187 INFO L226 Difference]: Without dead ends: 229 [2023-11-26 12:01:24,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-26 12:01:24,197 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 323 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:24,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 483 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-26 12:01:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-26 12:01:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 163. [2023-11-26 12:01:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 130 states have internal predecessors, (185), 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) [2023-11-26 12:01:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2023-11-26 12:01:24,319 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 48 [2023-11-26 12:01:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:24,321 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2023-11-26 12:01:24,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2023-11-26 12:01:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-26 12:01:24,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:24,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:24,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:01:24,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:24,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1330703, now seen corresponding path program 1 times [2023-11-26 12:01:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:24,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875668278] [2023-11-26 12:01:24,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:24,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:24,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:24,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:24,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875668278] [2023-11-26 12:01:24,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875668278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:24,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:24,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:01:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141472370] [2023-11-26 12:01:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:24,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:01:24,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:24,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:01:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:01:24,627 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:25,563 INFO L93 Difference]: Finished difference Result 573 states and 843 transitions. [2023-11-26 12:01:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 12:01:25,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-26 12:01:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:25,570 INFO L225 Difference]: With dead ends: 573 [2023-11-26 12:01:25,571 INFO L226 Difference]: Without dead ends: 419 [2023-11-26 12:01:25,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-26 12:01:25,576 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 319 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:25,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 419 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 12:01:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-11-26 12:01:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 299. [2023-11-26 12:01:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 237 states have (on average 1.4514767932489452) internal successors, (344), 242 states have internal predecessors, (344), 37 states have call successors, (37), 20 states have call predecessors, (37), 24 states have return successors, (54), 40 states have call predecessors, (54), 37 states have call successors, (54) [2023-11-26 12:01:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 435 transitions. [2023-11-26 12:01:25,639 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 435 transitions. Word has length 48 [2023-11-26 12:01:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:25,639 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 435 transitions. [2023-11-26 12:01:25,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 435 transitions. [2023-11-26 12:01:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-26 12:01:25,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:25,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:25,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:01:25,645 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:25,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:25,646 INFO L85 PathProgramCache]: Analyzing trace with hash 658200819, now seen corresponding path program 1 times [2023-11-26 12:01:25,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:25,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292187815] [2023-11-26 12:01:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:25,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:25,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:25,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292187815] [2023-11-26 12:01:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292187815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:25,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:01:25,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345338083] [2023-11-26 12:01:25,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:25,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:01:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:25,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:01:25,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:01:25,799 INFO L87 Difference]: Start difference. First operand 299 states and 435 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:26,508 INFO L93 Difference]: Finished difference Result 793 states and 1155 transitions. [2023-11-26 12:01:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:01:26,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-26 12:01:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:26,515 INFO L225 Difference]: With dead ends: 793 [2023-11-26 12:01:26,516 INFO L226 Difference]: Without dead ends: 503 [2023-11-26 12:01:26,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-26 12:01:26,520 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 334 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:26,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 349 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 12:01:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-11-26 12:01:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 431. [2023-11-26 12:01:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 340 states have (on average 1.4323529411764706) internal successors, (487), 349 states have internal predecessors, (487), 54 states have call successors, (54), 30 states have call predecessors, (54), 36 states have return successors, (75), 55 states have call predecessors, (75), 54 states have call successors, (75) [2023-11-26 12:01:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 616 transitions. [2023-11-26 12:01:26,580 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 616 transitions. Word has length 48 [2023-11-26 12:01:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:26,581 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 616 transitions. [2023-11-26 12:01:26,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 616 transitions. [2023-11-26 12:01:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-26 12:01:26,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:26,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:26,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:01:26,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:26,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1577175442, now seen corresponding path program 1 times [2023-11-26 12:01:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:26,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192620029] [2023-11-26 12:01:26,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:26,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:26,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:26,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:26,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:26,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:26,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192620029] [2023-11-26 12:01:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192620029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:26,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:01:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742760996] [2023-11-26 12:01:26,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:26,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:01:26,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:01:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:01:26,720 INFO L87 Difference]: Start difference. First operand 431 states and 616 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:27,142 INFO L93 Difference]: Finished difference Result 899 states and 1297 transitions. [2023-11-26 12:01:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:01:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-26 12:01:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:27,148 INFO L225 Difference]: With dead ends: 899 [2023-11-26 12:01:27,148 INFO L226 Difference]: Without dead ends: 477 [2023-11-26 12:01:27,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 12:01:27,178 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 100 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:27,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 282 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 12:01:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2023-11-26 12:01:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 435. [2023-11-26 12:01:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 344 states have (on average 1.4156976744186047) internal successors, (487), 353 states have internal predecessors, (487), 54 states have call successors, (54), 30 states have call predecessors, (54), 36 states have return successors, (75), 55 states have call predecessors, (75), 54 states have call successors, (75) [2023-11-26 12:01:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 616 transitions. [2023-11-26 12:01:27,230 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 616 transitions. Word has length 48 [2023-11-26 12:01:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:27,231 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 616 transitions. [2023-11-26 12:01:27,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 616 transitions. [2023-11-26 12:01:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-26 12:01:27,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:27,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:27,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:01:27,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:27,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1331588460, now seen corresponding path program 1 times [2023-11-26 12:01:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:27,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765298642] [2023-11-26 12:01:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:27,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765298642] [2023-11-26 12:01:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765298642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:27,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:01:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459085657] [2023-11-26 12:01:27,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:27,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:01:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:27,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:01:27,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:01:27,368 INFO L87 Difference]: Start difference. First operand 435 states and 616 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:27,784 INFO L93 Difference]: Finished difference Result 919 states and 1315 transitions. [2023-11-26 12:01:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:01:27,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-26 12:01:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:27,795 INFO L225 Difference]: With dead ends: 919 [2023-11-26 12:01:27,795 INFO L226 Difference]: Without dead ends: 493 [2023-11-26 12:01:27,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:01:27,803 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 95 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:27,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 278 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 12:01:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-11-26 12:01:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 447. [2023-11-26 12:01:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 356 states have (on average 1.401685393258427) internal successors, (499), 365 states have internal predecessors, (499), 54 states have call successors, (54), 30 states have call predecessors, (54), 36 states have return successors, (75), 55 states have call predecessors, (75), 54 states have call successors, (75) [2023-11-26 12:01:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 628 transitions. [2023-11-26 12:01:27,871 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 628 transitions. Word has length 48 [2023-11-26 12:01:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:27,872 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 628 transitions. [2023-11-26 12:01:27,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 628 transitions. [2023-11-26 12:01:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-26 12:01:27,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:27,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:27,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:01:27,876 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:27,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1465601966, now seen corresponding path program 1 times [2023-11-26 12:01:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:27,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617981296] [2023-11-26 12:01:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:27,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:27,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:28,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:28,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617981296] [2023-11-26 12:01:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617981296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:28,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:01:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30259213] [2023-11-26 12:01:28,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:28,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:01:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:28,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:01:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:01:28,084 INFO L87 Difference]: Start difference. First operand 447 states and 628 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:28,743 INFO L93 Difference]: Finished difference Result 897 states and 1264 transitions. [2023-11-26 12:01:28,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 12:01:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-26 12:01:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:28,749 INFO L225 Difference]: With dead ends: 897 [2023-11-26 12:01:28,750 INFO L226 Difference]: Without dead ends: 655 [2023-11-26 12:01:28,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-26 12:01:28,753 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 292 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:28,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 312 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 12:01:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-11-26 12:01:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 583. [2023-11-26 12:01:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 468 states have (on average 1.3717948717948718) internal successors, (642), 478 states have internal predecessors, (642), 68 states have call successors, (68), 40 states have call predecessors, (68), 46 states have return successors, (83), 68 states have call predecessors, (83), 68 states have call successors, (83) [2023-11-26 12:01:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 793 transitions. [2023-11-26 12:01:28,818 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 793 transitions. Word has length 48 [2023-11-26 12:01:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:28,819 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 793 transitions. [2023-11-26 12:01:28,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 793 transitions. [2023-11-26 12:01:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-26 12:01:28,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:28,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:28,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:01:28,822 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:28,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2011716880, now seen corresponding path program 1 times [2023-11-26 12:01:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850513434] [2023-11-26 12:01:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:28,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850513434] [2023-11-26 12:01:28,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850513434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:28,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:28,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 12:01:28,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274746010] [2023-11-26 12:01:28,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:28,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:01:28,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:28,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:01:28,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:01:28,992 INFO L87 Difference]: Start difference. First operand 583 states and 793 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:29,791 INFO L93 Difference]: Finished difference Result 1008 states and 1369 transitions. [2023-11-26 12:01:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 12:01:29,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-26 12:01:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:29,797 INFO L225 Difference]: With dead ends: 1008 [2023-11-26 12:01:29,797 INFO L226 Difference]: Without dead ends: 634 [2023-11-26 12:01:29,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-11-26 12:01:29,800 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 301 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:29,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 354 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 12:01:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-11-26 12:01:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 511. [2023-11-26 12:01:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 411 states have (on average 1.364963503649635) internal successors, (561), 418 states have internal predecessors, (561), 61 states have call successors, (61), 35 states have call predecessors, (61), 38 states have return successors, (66), 59 states have call predecessors, (66), 61 states have call successors, (66) [2023-11-26 12:01:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 688 transitions. [2023-11-26 12:01:29,854 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 688 transitions. Word has length 48 [2023-11-26 12:01:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:29,854 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 688 transitions. [2023-11-26 12:01:29,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 688 transitions. [2023-11-26 12:01:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-26 12:01:29,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:29,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:29,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:01:29,857 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:29,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:29,858 INFO L85 PathProgramCache]: Analyzing trace with hash 322773138, now seen corresponding path program 1 times [2023-11-26 12:01:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480643529] [2023-11-26 12:01:29,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:29,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:29,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:29,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:29,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:30,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480643529] [2023-11-26 12:01:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480643529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:30,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:01:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772583799] [2023-11-26 12:01:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:30,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:01:30,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:30,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:01:30,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:01:30,022 INFO L87 Difference]: Start difference. First operand 511 states and 688 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:30,520 INFO L93 Difference]: Finished difference Result 1573 states and 2148 transitions. [2023-11-26 12:01:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:01:30,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-26 12:01:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:30,530 INFO L225 Difference]: With dead ends: 1573 [2023-11-26 12:01:30,530 INFO L226 Difference]: Without dead ends: 1071 [2023-11-26 12:01:30,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-26 12:01:30,534 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 342 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:30,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 230 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 12:01:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-11-26 12:01:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 975. [2023-11-26 12:01:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 782 states have (on average 1.3427109974424551) internal successors, (1050), 794 states have internal predecessors, (1050), 115 states have call successors, (115), 70 states have call predecessors, (115), 77 states have return successors, (149), 114 states have call predecessors, (149), 115 states have call successors, (149) [2023-11-26 12:01:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1314 transitions. [2023-11-26 12:01:30,658 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1314 transitions. Word has length 48 [2023-11-26 12:01:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:30,659 INFO L495 AbstractCegarLoop]: Abstraction has 975 states and 1314 transitions. [2023-11-26 12:01:30,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1314 transitions. [2023-11-26 12:01:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-26 12:01:30,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:30,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:30,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:01:30,662 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:30,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash 749432211, now seen corresponding path program 1 times [2023-11-26 12:01:30,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484567268] [2023-11-26 12:01:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:30,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:30,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:30,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:30,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484567268] [2023-11-26 12:01:30,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484567268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:30,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:30,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:01:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150500011] [2023-11-26 12:01:30,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:30,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:01:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:01:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:01:30,735 INFO L87 Difference]: Start difference. First operand 975 states and 1314 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:31,052 INFO L93 Difference]: Finished difference Result 1809 states and 2412 transitions. [2023-11-26 12:01:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:01:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2023-11-26 12:01:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:31,059 INFO L225 Difference]: With dead ends: 1809 [2023-11-26 12:01:31,059 INFO L226 Difference]: Without dead ends: 843 [2023-11-26 12:01:31,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:01:31,063 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 218 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:31,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 150 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 12:01:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2023-11-26 12:01:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 760. [2023-11-26 12:01:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 618 states have (on average 1.3284789644012944) internal successors, (821), 627 states have internal predecessors, (821), 83 states have call successors, (83), 53 states have call predecessors, (83), 58 states have return successors, (101), 81 states have call predecessors, (101), 83 states have call successors, (101) [2023-11-26 12:01:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1005 transitions. [2023-11-26 12:01:31,132 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1005 transitions. Word has length 49 [2023-11-26 12:01:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:31,133 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1005 transitions. [2023-11-26 12:01:31,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 12:01:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1005 transitions. [2023-11-26 12:01:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-26 12:01:31,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:31,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:31,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:01:31,135 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:31,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -6529051, now seen corresponding path program 1 times [2023-11-26 12:01:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291066825] [2023-11-26 12:01:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:31,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291066825] [2023-11-26 12:01:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291066825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:31,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:31,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:01:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210755195] [2023-11-26 12:01:31,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:31,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:01:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:31,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:01:31,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:01:31,210 INFO L87 Difference]: Start difference. First operand 760 states and 1005 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-26 12:01:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:31,711 INFO L93 Difference]: Finished difference Result 2338 states and 3090 transitions. [2023-11-26 12:01:31,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:01:31,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2023-11-26 12:01:31,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:31,724 INFO L225 Difference]: With dead ends: 2338 [2023-11-26 12:01:31,725 INFO L226 Difference]: Without dead ends: 1586 [2023-11-26 12:01:31,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:01:31,730 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 272 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:31,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 197 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 12:01:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2023-11-26 12:01:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1437. [2023-11-26 12:01:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1158 states have (on average 1.2962003454231434) internal successors, (1501), 1175 states have internal predecessors, (1501), 162 states have call successors, (162), 106 states have call predecessors, (162), 116 states have return successors, (197), 157 states have call predecessors, (197), 162 states have call successors, (197) [2023-11-26 12:01:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1860 transitions. [2023-11-26 12:01:31,871 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1860 transitions. Word has length 50 [2023-11-26 12:01:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:31,872 INFO L495 AbstractCegarLoop]: Abstraction has 1437 states and 1860 transitions. [2023-11-26 12:01:31,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-26 12:01:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1860 transitions. [2023-11-26 12:01:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-26 12:01:31,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:31,874 INFO L195 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] [2023-11-26 12:01:31,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:01:31,875 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:31,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash -113707821, now seen corresponding path program 1 times [2023-11-26 12:01:31,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:31,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892557578] [2023-11-26 12:01:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:01:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:01:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:01:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:01:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:32,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:01:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:01:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:01:32,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:32,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892557578] [2023-11-26 12:01:32,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892557578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:32,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:32,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:01:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591942975] [2023-11-26 12:01:32,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:32,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:01:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:32,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:01:32,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:01:32,061 INFO L87 Difference]: Start difference. First operand 1437 states and 1860 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-26 12:01:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:33,082 INFO L93 Difference]: Finished difference Result 4471 states and 5825 transitions. [2023-11-26 12:01:33,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 12:01:33,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 67 [2023-11-26 12:01:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:33,102 INFO L225 Difference]: With dead ends: 4471 [2023-11-26 12:01:33,102 INFO L226 Difference]: Without dead ends: 2336 [2023-11-26 12:01:33,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-26 12:01:33,110 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 478 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:33,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 376 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 12:01:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2023-11-26 12:01:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2170. [2023-11-26 12:01:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 1741 states have (on average 1.2820218265364733) internal successors, (2232), 1779 states have internal predecessors, (2232), 241 states have call successors, (241), 159 states have call predecessors, (241), 187 states have return successors, (343), 233 states have call predecessors, (343), 241 states have call successors, (343) [2023-11-26 12:01:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2816 transitions. [2023-11-26 12:01:33,357 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2816 transitions. Word has length 67 [2023-11-26 12:01:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:33,358 INFO L495 AbstractCegarLoop]: Abstraction has 2170 states and 2816 transitions. [2023-11-26 12:01:33,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-26 12:01:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2816 transitions. [2023-11-26 12:01:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-26 12:01:33,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:33,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:33,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:01:33,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:33,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1200743010, now seen corresponding path program 1 times [2023-11-26 12:01:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562906113] [2023-11-26 12:01:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:33,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:33,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:33,428 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:01:33,430 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 12:01:33,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:01:33,436 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:33,441 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:01:33,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-26 12:01:33,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-26 12:01:33,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:01:33 BoogieIcfgContainer [2023-11-26 12:01:33,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:01:33,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:01:33,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:01:33,541 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:01:33,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:21" (3/4) ... [2023-11-26 12:01:33,542 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 12:01:33,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-26 12:01:33,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-26 12:01:33,699 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 12:01:33,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:01:33,701 INFO L158 Benchmark]: Toolchain (without parser) took 13090.67ms. Allocated memory was 136.3MB in the beginning and 222.3MB in the end (delta: 86.0MB). Free memory was 97.4MB in the beginning and 152.8MB in the end (delta: -55.4MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2023-11-26 12:01:33,701 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 136.3MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:01:33,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.37ms. Allocated memory is still 136.3MB. Free memory was 97.0MB in the beginning and 84.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 12:01:33,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.11ms. Allocated memory is still 136.3MB. Free memory was 84.1MB in the beginning and 82.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:01:33,703 INFO L158 Benchmark]: Boogie Preprocessor took 52.73ms. Allocated memory is still 136.3MB. Free memory was 82.4MB in the beginning and 79.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:01:33,703 INFO L158 Benchmark]: RCFGBuilder took 657.00ms. Allocated memory is still 136.3MB. Free memory was 79.9MB in the beginning and 61.4MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 12:01:33,704 INFO L158 Benchmark]: TraceAbstraction took 11708.07ms. Allocated memory was 136.3MB in the beginning and 222.3MB in the end (delta: 86.0MB). Free memory was 60.7MB in the beginning and 158.0MB in the end (delta: -97.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:01:33,704 INFO L158 Benchmark]: Witness Printer took 159.75ms. Allocated memory is still 222.3MB. Free memory was 158.0MB in the beginning and 152.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:01:33,707 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.28ms. Allocated memory is still 136.3MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.37ms. Allocated memory is still 136.3MB. Free memory was 97.0MB in the beginning and 84.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.11ms. Allocated memory is still 136.3MB. Free memory was 84.1MB in the beginning and 82.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.73ms. Allocated memory is still 136.3MB. Free memory was 82.4MB in the beginning and 79.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 657.00ms. Allocated memory is still 136.3MB. Free memory was 79.9MB in the beginning and 61.4MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11708.07ms. Allocated memory was 136.3MB in the beginning and 222.3MB in the end (delta: 86.0MB). Free memory was 60.7MB in the beginning and 158.0MB in the end (delta: -97.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 159.75ms. Allocated memory is still 222.3MB. Free memory was 158.0MB in the beginning and 152.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L400] RET activate_threads() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L211-L222] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE, EXPR \read(tmp_ndt_2) [L230] EXPR t1_st = 1 [L231] CALL, EXPR transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L231] RET, EXPR transmit1() [L225-L236] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE, EXPR \read(tmp_ndt_1) [L216] EXPR m_st = 1 [L217] CALL, EXPR master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 [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); [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L322] RET activate_threads() VAL [E_1=1, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET, EXPR master() [L211-L222] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 [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, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3181 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3074 mSDsluCounter, 3430 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2443 mSDsCounter, 531 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4270 IncrementalHoareTripleChecker+Invalid, 4801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 531 mSolverCounterUnsat, 987 mSDtfsCounter, 4270 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2170occurred in iteration=11, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1035 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 1127 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-26 12:01:33,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04533eb-6183-4899-8393-258aa0740a89/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE