./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:02:48,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:02:48,766 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:02:48,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:02:48,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:02:48,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:02:48,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:02:48,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:02:48,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:02:48,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:02:48,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:02:48,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:02:48,826 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:02:48,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:02:48,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:02:48,829 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:02:48,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:02:48,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:02:48,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:02:48,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:02:48,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:02:48,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:02:48,833 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:02:48,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:02:48,833 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:02:48,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:02:48,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:02:48,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:02:48,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:48,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:02:48,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:02:48,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:02:48,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:02:48,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:02:48,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:02:48,838 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:02:48,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:02:48,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:02:48,839 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:02:48,839 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_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/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_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2023-11-06 22:02:49,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:02:49,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:02:49,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:02:49,200 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:02:49,201 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:02:49,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2023-11-06 22:02:52,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:02:52,469 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:02:52,469 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2023-11-06 22:02:52,480 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/data/95fc84387/c4f8f67aa32e4983a25325ab396c96da/FLAG11c595aa4 [2023-11-06 22:02:52,496 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/data/95fc84387/c4f8f67aa32e4983a25325ab396c96da [2023-11-06 22:02:52,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:02:52,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:02:52,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:52,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:02:52,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:02:52,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b4491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52, skipping insertion in model container [2023-11-06 22:02:52,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,573 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:02:52,760 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_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2023-11-06 22:02:52,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:52,852 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:02:52,867 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_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2023-11-06 22:02:52,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:52,906 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:02:52,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52 WrapperNode [2023-11-06 22:02:52,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:52,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:52,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:02:52,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:02:52,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,951 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 204 [2023-11-06 22:02:52,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:52,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:02:52,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:02:52,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:02:52,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:02:52,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:02:52,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:02:52,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:02:52,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (1/1) ... [2023-11-06 22:02:52,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:53,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:53,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:02:53,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:02:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:02:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-06 22:02:53,064 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-06 22:02:53,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:02:53,065 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-06 22:02:53,065 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-06 22:02:53,065 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-11-06 22:02:53,065 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-11-06 22:02:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:02:53,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:02:53,149 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:02:53,152 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:02:53,479 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:02:53,487 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:02:53,488 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:02:53,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:53 BoogieIcfgContainer [2023-11-06 22:02:53,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:02:53,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:02:53,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:02:53,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:02:53,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:02:52" (1/3) ... [2023-11-06 22:02:53,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c02e2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:53, skipping insertion in model container [2023-11-06 22:02:53,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:52" (2/3) ... [2023-11-06 22:02:53,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c02e2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:53, skipping insertion in model container [2023-11-06 22:02:53,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:53" (3/3) ... [2023-11-06 22:02:53,514 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2023-11-06 22:02:53,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:02:53,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:02:53,588 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:02:53,593 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f7dffa4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:02:53,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:02:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:02:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:02:53,606 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:53,607 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] [2023-11-06 22:02:53,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:53,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash -21131724, now seen corresponding path program 1 times [2023-11-06 22:02:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:53,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204224897] [2023-11-06 22:02:53,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:53,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:53,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:02:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:02:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:53,901 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-06 22:02:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:53,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204224897] [2023-11-06 22:02:53,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204224897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:53,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:53,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:53,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329345021] [2023-11-06 22:02:53,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:53,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:53,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:53,959 INFO L87 Difference]: Start difference. First operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:54,296 INFO L93 Difference]: Finished difference Result 214 states and 325 transitions. [2023-11-06 22:02:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:54,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2023-11-06 22:02:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:54,311 INFO L225 Difference]: With dead ends: 214 [2023-11-06 22:02:54,312 INFO L226 Difference]: Without dead ends: 138 [2023-11-06 22:02:54,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:54,319 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 103 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:54,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 261 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:02:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-06 22:02:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2023-11-06 22:02:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 118 states have internal predecessors, (160), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-06 22:02:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2023-11-06 22:02:54,382 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 43 [2023-11-06 22:02:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:54,383 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2023-11-06 22:02:54,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2023-11-06 22:02:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 22:02:54,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:54,388 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] [2023-11-06 22:02:54,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:02:54,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:54,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1928738726, now seen corresponding path program 1 times [2023-11-06 22:02:54,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:54,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876638227] [2023-11-06 22:02:54,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:02:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:54,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:02:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:54,504 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-06 22:02:54,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876638227] [2023-11-06 22:02:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876638227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:54,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:54,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:54,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921535261] [2023-11-06 22:02:54,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:54,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:54,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:54,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:54,509 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:54,657 INFO L93 Difference]: Finished difference Result 380 states and 524 transitions. [2023-11-06 22:02:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:54,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-11-06 22:02:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:54,665 INFO L225 Difference]: With dead ends: 380 [2023-11-06 22:02:54,666 INFO L226 Difference]: Without dead ends: 256 [2023-11-06 22:02:54,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:54,670 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 100 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:54,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 274 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-06 22:02:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2023-11-06 22:02:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 177 states have (on average 1.3785310734463276) internal successors, (244), 179 states have internal predecessors, (244), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2023-11-06 22:02:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 274 transitions. [2023-11-06 22:02:54,751 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 274 transitions. Word has length 44 [2023-11-06 22:02:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:54,752 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 274 transitions. [2023-11-06 22:02:54,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 274 transitions. [2023-11-06 22:02:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 22:02:54,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:54,756 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] [2023-11-06 22:02:54,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:02:54,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:54,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:54,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1081871109, now seen corresponding path program 1 times [2023-11-06 22:02:54,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694039062] [2023-11-06 22:02:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:02:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:54,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:02:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:54,963 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-06 22:02:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694039062] [2023-11-06 22:02:54,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694039062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:54,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:54,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:54,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962997389] [2023-11-06 22:02:54,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:54,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:54,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:54,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:54,970 INFO L87 Difference]: Start difference. First operand 199 states and 274 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:55,158 INFO L93 Difference]: Finished difference Result 607 states and 833 transitions. [2023-11-06 22:02:55,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:55,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-11-06 22:02:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:55,172 INFO L225 Difference]: With dead ends: 607 [2023-11-06 22:02:55,172 INFO L226 Difference]: Without dead ends: 416 [2023-11-06 22:02:55,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:55,177 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 117 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:55,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 243 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2023-11-06 22:02:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 364. [2023-11-06 22:02:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 323 states have (on average 1.3436532507739938) internal successors, (434), 328 states have internal predecessors, (434), 24 states have call successors, (24), 15 states have call predecessors, (24), 16 states have return successors, (34), 20 states have call predecessors, (34), 22 states have call successors, (34) [2023-11-06 22:02:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 492 transitions. [2023-11-06 22:02:55,246 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 492 transitions. Word has length 44 [2023-11-06 22:02:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:55,247 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 492 transitions. [2023-11-06 22:02:55,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2023-11-06 22:02:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:02:55,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:55,253 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] [2023-11-06 22:02:55,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:02:55,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:55,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1162995804, now seen corresponding path program 1 times [2023-11-06 22:02:55,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:55,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551028673] [2023-11-06 22:02:55,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:55,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:02:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:55,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:02:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:55,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551028673] [2023-11-06 22:02:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551028673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:55,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:55,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226255204] [2023-11-06 22:02:55,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:55,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:55,386 INFO L87 Difference]: Start difference. First operand 364 states and 492 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:55,547 INFO L93 Difference]: Finished difference Result 948 states and 1277 transitions. [2023-11-06 22:02:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:55,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 61 [2023-11-06 22:02:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:55,553 INFO L225 Difference]: With dead ends: 948 [2023-11-06 22:02:55,553 INFO L226 Difference]: Without dead ends: 592 [2023-11-06 22:02:55,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:55,557 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 84 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:55,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 327 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2023-11-06 22:02:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 554. [2023-11-06 22:02:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 489 states have (on average 1.296523517382413) internal successors, (634), 496 states have internal predecessors, (634), 38 states have call successors, (38), 23 states have call predecessors, (38), 26 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2023-11-06 22:02:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 730 transitions. [2023-11-06 22:02:55,636 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 730 transitions. Word has length 61 [2023-11-06 22:02:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:55,637 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 730 transitions. [2023-11-06 22:02:55,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 730 transitions. [2023-11-06 22:02:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:02:55,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:55,644 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] [2023-11-06 22:02:55,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:02:55,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:55,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1047893343, now seen corresponding path program 1 times [2023-11-06 22:02:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661544128] [2023-11-06 22:02:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:55,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:02:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:02:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:02:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:02:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:55,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661544128] [2023-11-06 22:02:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661544128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:55,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:55,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391343365] [2023-11-06 22:02:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:55,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:55,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:55,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:55,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:55,767 INFO L87 Difference]: Start difference. First operand 554 states and 730 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:55,958 INFO L93 Difference]: Finished difference Result 1207 states and 1583 transitions. [2023-11-06 22:02:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:55,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2023-11-06 22:02:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:55,967 INFO L225 Difference]: With dead ends: 1207 [2023-11-06 22:02:55,967 INFO L226 Difference]: Without dead ends: 753 [2023-11-06 22:02:55,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:55,971 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:55,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 242 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2023-11-06 22:02:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 698. [2023-11-06 22:02:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 617 states have (on average 1.2722852512155591) internal successors, (785), 626 states have internal predecessors, (785), 46 states have call successors, (46), 29 states have call predecessors, (46), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2023-11-06 22:02:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 903 transitions. [2023-11-06 22:02:56,071 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 903 transitions. Word has length 66 [2023-11-06 22:02:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:56,071 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 903 transitions. [2023-11-06 22:02:56,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:02:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 903 transitions. [2023-11-06 22:02:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:02:56,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:56,075 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:02:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:02:56,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:56,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1099770361, now seen corresponding path program 1 times [2023-11-06 22:02:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363869836] [2023-11-06 22:02:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:56,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:02:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:02:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:02:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:02:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:56,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363869836] [2023-11-06 22:02:56,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363869836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:56,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117496493] [2023-11-06 22:02:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:56,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:56,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:56,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:56,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:02:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:56,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:02:56,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:56,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:02:56,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117496493] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:56,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:56,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2023-11-06 22:02:56,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39494029] [2023-11-06 22:02:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:56,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:56,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:56,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:56,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:02:56,641 INFO L87 Difference]: Start difference. First operand 698 states and 903 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:56,769 INFO L93 Difference]: Finished difference Result 754 states and 971 transitions. [2023-11-06 22:02:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:56,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 67 [2023-11-06 22:02:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:56,788 INFO L225 Difference]: With dead ends: 754 [2023-11-06 22:02:56,788 INFO L226 Difference]: Without dead ends: 751 [2023-11-06 22:02:56,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:02:56,794 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 173 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:56,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 184 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2023-11-06 22:02:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 697. [2023-11-06 22:02:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 617 states have (on average 1.2690437601296596) internal successors, (783), 625 states have internal predecessors, (783), 45 states have call successors, (45), 29 states have call predecessors, (45), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2023-11-06 22:02:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 900 transitions. [2023-11-06 22:02:56,906 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 900 transitions. Word has length 67 [2023-11-06 22:02:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:56,908 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 900 transitions. [2023-11-06 22:02:56,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 900 transitions. [2023-11-06 22:02:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 22:02:56,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:56,912 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:02:56,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:57,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:02:57,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:57,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash -267180508, now seen corresponding path program 1 times [2023-11-06 22:02:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:57,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036867136] [2023-11-06 22:02:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:02:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:57,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:02:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:02:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:02:57,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036867136] [2023-11-06 22:02:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036867136] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990651595] [2023-11-06 22:02:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:57,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:57,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:57,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:57,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:02:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:57,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:02:57,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:57,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:02:57,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990651595] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:02:57,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:02:57,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2023-11-06 22:02:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452359906] [2023-11-06 22:02:57,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:57,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:02:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:02:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:02:57,879 INFO L87 Difference]: Start difference. First operand 697 states and 900 transitions. Second operand has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-06 22:02:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:59,015 INFO L93 Difference]: Finished difference Result 2397 states and 3120 transitions. [2023-11-06 22:02:59,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-06 22:02:59,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 68 [2023-11-06 22:02:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:59,029 INFO L225 Difference]: With dead ends: 2397 [2023-11-06 22:02:59,029 INFO L226 Difference]: Without dead ends: 1853 [2023-11-06 22:02:59,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1514, Unknown=0, NotChecked=0, Total=1806 [2023-11-06 22:02:59,034 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 374 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:59,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1552 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:02:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2023-11-06 22:02:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1086. [2023-11-06 22:02:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 967 states have (on average 1.2585315408479834) internal successors, (1217), 983 states have internal predecessors, (1217), 65 states have call successors, (65), 43 states have call predecessors, (65), 53 states have return successors, (106), 59 states have call predecessors, (106), 64 states have call successors, (106) [2023-11-06 22:02:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1388 transitions. [2023-11-06 22:02:59,252 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1388 transitions. Word has length 68 [2023-11-06 22:02:59,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:59,253 INFO L495 AbstractCegarLoop]: Abstraction has 1086 states and 1388 transitions. [2023-11-06 22:02:59,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-06 22:02:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1388 transitions. [2023-11-06 22:02:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 22:02:59,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:59,259 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 22:02:59,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:59,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:02:59,465 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:59,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash 235450586, now seen corresponding path program 1 times [2023-11-06 22:02:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572490481] [2023-11-06 22:02:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:59,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:59,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:02:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:59,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:02:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:02:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:59,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:02:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-06 22:02:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572490481] [2023-11-06 22:02:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572490481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252896539] [2023-11-06 22:02:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:59,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:59,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:59,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:59,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:02:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:59,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:02:59,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:02:59,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:59,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252896539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:59,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:02:59,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-06 22:02:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6446016] [2023-11-06 22:02:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:59,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:59,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:59,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:02:59,756 INFO L87 Difference]: Start difference. First operand 1086 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:02:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:59,874 INFO L93 Difference]: Finished difference Result 1809 states and 2326 transitions. [2023-11-06 22:02:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:59,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 87 [2023-11-06 22:02:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:59,896 INFO L225 Difference]: With dead ends: 1809 [2023-11-06 22:02:59,897 INFO L226 Difference]: Without dead ends: 964 [2023-11-06 22:02:59,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:02:59,900 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:59,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 198 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-11-06 22:03:00,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 949. [2023-11-06 22:03:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 846 states have (on average 1.25177304964539) internal successors, (1059), 861 states have internal predecessors, (1059), 57 states have call successors, (57), 37 states have call predecessors, (57), 45 states have return successors, (92), 50 states have call predecessors, (92), 56 states have call successors, (92) [2023-11-06 22:03:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1208 transitions. [2023-11-06 22:03:00,019 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1208 transitions. Word has length 87 [2023-11-06 22:03:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:00,020 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1208 transitions. [2023-11-06 22:03:00,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:03:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1208 transitions. [2023-11-06 22:03:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 22:03:00,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:00,026 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 22:03:00,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:00,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:03:00,232 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:00,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1832296466, now seen corresponding path program 1 times [2023-11-06 22:03:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050820217] [2023-11-06 22:03:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:03:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:00,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:03:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:03:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:03:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:03:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-06 22:03:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050820217] [2023-11-06 22:03:00,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050820217] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:00,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947024425] [2023-11-06 22:03:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:00,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:00,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:00,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:03:00,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:03:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:00,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:03:00,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:03:00,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947024425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:00,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:03:00,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-06 22:03:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820860402] [2023-11-06 22:03:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:00,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:03:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:03:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:03:00,525 INFO L87 Difference]: Start difference. First operand 949 states and 1208 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-06 22:03:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:00,604 INFO L93 Difference]: Finished difference Result 1328 states and 1676 transitions. [2023-11-06 22:03:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:03:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 102 [2023-11-06 22:03:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:00,606 INFO L225 Difference]: With dead ends: 1328 [2023-11-06 22:03:00,606 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:03:00,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:03:00,609 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 62 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:00,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 206 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:03:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:03:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:03:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:03:00,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2023-11-06 22:03:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:00,628 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:03:00,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-06 22:03:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:03:00,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:03:00,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:03:00,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:00,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 22:03:00,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:03:04,774 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2023-11-06 22:03:04,774 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2023-11-06 22:03:04,774 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 76 100) no Hoare annotation was computed. [2023-11-06 22:03:04,775 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 76 100) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse0 (and .cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= ~q_free~0 0)))) (and (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse0 (not (= ~p_dw_pc~0 0)) .cse1 (not (= ~c_num_read~0 0)) .cse2) (or .cse0 .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2)) (or (not (= 2 |old(~c_dr_st~0)|)) .cse1 .cse2 (and .cse3 (= ~c_dr_st~0 2)) (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))))) [2023-11-06 22:03:04,775 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2023-11-06 22:03:04,775 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2023-11-06 22:03:04,775 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2023-11-06 22:03:04,776 INFO L899 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2023-11-06 22:03:04,776 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 76 100) no Hoare annotation was computed. [2023-11-06 22:03:04,776 INFO L895 garLoopResultBuilder]: At program point is_do_write_p_triggered_returnLabel#1(lines 38 56) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0))) (.cse3 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse5 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (not (= 2 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~q_free~0 0))) (.cse2 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))) (and (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) (not (= ~c_num_read~0 0)) .cse6) (or .cse7 .cse0 .cse1 .cse6 (and .cse3 .cse5) .cse8) (or (and .cse2 .cse4) .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2)) (or .cse7 .cse1 .cse6 (and .cse2 (= ~c_dr_st~0 2)) .cse8))) [2023-11-06 22:03:04,777 INFO L895 garLoopResultBuilder]: At program point L53(lines 41 55) the Hoare annotation is: (let ((.cse2 (not (= ~p_dw_pc~0 0))) (.cse0 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= ~q_free~0 0))) (.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse5 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse2 .cse3 (not (= ~c_num_read~0 0)) .cse4 (and .cse6 .cse0 .cse7)) (or (and .cse6 .cse7) .cse3 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2)) (or .cse1 .cse3 .cse4 (and .cse6 (= ~c_dr_st~0 2)) .cse5))) [2023-11-06 22:03:04,777 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2023-11-06 22:03:04,777 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 88) no Hoare annotation was computed. [2023-11-06 22:03:04,777 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2023-11-06 22:03:04,778 INFO L895 garLoopResultBuilder]: At program point L72(lines 60 74) the Hoare annotation is: (let ((.cse3 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (not (= ~q_free~0 0))) (.cse7 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (= |immediate_notify_threads_~tmp~0#1| 0)) (.cse8 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (= ~p_dw_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7) (or (and .cse1 .cse2 .cse8 .cse3) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse6) (let ((.cse9 (= ~c_dr_st~0 2))) (or .cse0 (and .cse9 .cse10) .cse5 .cse6 (and .cse1 .cse9) .cse7)) (or (and .cse1 .cse2 .cse8) .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse10 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2)))) [2023-11-06 22:03:04,778 INFO L895 garLoopResultBuilder]: At program point is_do_read_c_triggered_returnLabel#1(lines 57 75) the Hoare annotation is: (let ((.cse3 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (not (= ~q_free~0 0))) (.cse7 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (= |immediate_notify_threads_~tmp~0#1| 0)) (.cse8 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (= ~p_dw_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7) (or (and .cse1 .cse2 .cse8 .cse3) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse6) (let ((.cse9 (= ~c_dr_st~0 2))) (or .cse0 (and .cse9 .cse10) .cse5 .cse6 (and .cse1 .cse9) .cse7)) (or (and .cse1 .cse2 .cse8) .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse10 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2)))) [2023-11-06 22:03:04,778 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 234) no Hoare annotation was computed. [2023-11-06 22:03:04,778 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 220 239) no Hoare annotation was computed. [2023-11-06 22:03:04,779 INFO L902 garLoopResultBuilder]: At program point L236(lines 223 238) the Hoare annotation is: true [2023-11-06 22:03:04,779 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 220 239) the Hoare annotation is: true [2023-11-06 22:03:04,779 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2023-11-06 22:03:04,779 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 220 239) no Hoare annotation was computed. [2023-11-06 22:03:04,779 INFO L895 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2023-11-06 22:03:04,779 INFO L895 garLoopResultBuilder]: At program point L192-1(lines 160 195) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~q_free~0 0) .cse1) (and .cse2 .cse0 .cse3 (= ~p_dw_st~0 0) .cse4) (and .cse2 .cse0 .cse3 .cse4 .cse1))) [2023-11-06 22:03:04,779 INFO L899 garLoopResultBuilder]: For program point L250(line 250) no Hoare annotation was computed. [2023-11-06 22:03:04,780 INFO L899 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2023-11-06 22:03:04,780 INFO L895 garLoopResultBuilder]: At program point L300(line 300) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-11-06 22:03:04,780 INFO L899 garLoopResultBuilder]: For program point L300-1(line 300) no Hoare annotation was computed. [2023-11-06 22:03:04,787 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 359 370) the Hoare annotation is: true [2023-11-06 22:03:04,788 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:03:04,788 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 101 143) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2))) [2023-11-06 22:03:04,788 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2023-11-06 22:03:04,788 INFO L895 garLoopResultBuilder]: At program point L119(lines 119 127) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0))) (or (and (= ~c_num_read~0 ~p_num_write~0) (= ~c_dr_st~0 2) .cse0) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 (= ~c_dr_pc~0 0)))) [2023-11-06 22:03:04,788 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 313 341) the Hoare annotation is: true [2023-11-06 22:03:04,789 INFO L895 garLoopResultBuilder]: At program point L309(lines 298 311) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-11-06 22:03:04,789 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2023-11-06 22:03:04,789 INFO L899 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2023-11-06 22:03:04,789 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 145 201) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~p_dw_st~0)))) [2023-11-06 22:03:04,790 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2023-11-06 22:03:04,790 INFO L899 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2023-11-06 22:03:04,790 INFO L895 garLoopResultBuilder]: At program point L211-1(lines 202 219) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 1)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~p_dw_st~0)))) [2023-11-06 22:03:04,790 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 307) no Hoare annotation was computed. [2023-11-06 22:03:04,790 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:03:04,791 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2023-11-06 22:03:04,791 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2023-11-06 22:03:04,791 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: false [2023-11-06 22:03:04,791 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (and (= ~c_num_read~0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~p_dw_st~0)) [2023-11-06 22:03:04,791 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2023-11-06 22:03:04,792 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 240 293) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-11-06 22:03:04,792 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2023-11-06 22:03:04,792 INFO L895 garLoopResultBuilder]: At program point do_read_c_DR_WAIT_WRITE#1(lines 148 200) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~q_free~0 0) (<= 2 ~p_dw_st~0)) [2023-11-06 22:03:04,792 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:03:04,793 INFO L895 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-11-06 22:03:04,793 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 210) no Hoare annotation was computed. [2023-11-06 22:03:04,793 INFO L899 garLoopResultBuilder]: For program point L206-2(lines 205 218) no Hoare annotation was computed. [2023-11-06 22:03:04,793 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2023-11-06 22:03:04,793 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:03:04,794 INFO L895 garLoopResultBuilder]: At program point L248(line 248) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-11-06 22:03:04,794 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2023-11-06 22:03:04,794 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-11-06 22:03:04,795 INFO L899 garLoopResultBuilder]: For program point L257(lines 247 287) no Hoare annotation was computed. [2023-11-06 22:03:04,795 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 335) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-11-06 22:03:04,795 INFO L895 garLoopResultBuilder]: At program point init_model_returnLabel#1(lines 342 358) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2023-11-06 22:03:04,796 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2023-11-06 22:03:04,796 INFO L895 garLoopResultBuilder]: At program point L117-1(lines 117 137) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 0))) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3))) [2023-11-06 22:03:04,796 INFO L895 garLoopResultBuilder]: At program point stop_simulation_returnLabel#1(lines 294 312) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-11-06 22:03:04,796 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2023-11-06 22:03:04,797 INFO L895 garLoopResultBuilder]: At program point L134(line 134) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse0 .cse1 (= ~c_dr_pc~0 0) (= ~p_num_write~0 1)))) [2023-11-06 22:03:04,797 INFO L899 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2023-11-06 22:03:04,797 INFO L899 garLoopResultBuilder]: For program point L324(line 324) no Hoare annotation was computed. [2023-11-06 22:03:04,798 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2023-11-06 22:03:04,798 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2023-11-06 22:03:04,798 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:03:04,798 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2023-11-06 22:03:04,803 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:04,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:03:04,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:03:04 BoogieIcfgContainer [2023-11-06 22:03:04,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:03:04,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:03:04,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:03:04,893 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:03:04,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:53" (3/4) ... [2023-11-06 22:03:04,896 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:03:04,900 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2023-11-06 22:03:04,900 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-06 22:03:04,900 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-06 22:03:04,910 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-11-06 22:03:04,911 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:03:04,911 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:03:04,912 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:03:04,947 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__retres1 == 0) || !((2 == \old(c_dr_st)))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !(((c_num_read + 1) == p_num_write))) && ((((((!((p_num_write == 1)) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (((\old(p_dw_st) == p_dw_st) && (__retres1 == 0)) && (c_dr_st == \old(c_dr_st))))) && (((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) && ((((!((2 == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) [2023-11-06 22:03:04,947 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!((p_num_write == 1)) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || ((((\old(p_dw_st) == p_dw_st) && (__retres1 == 0)) && (c_dr_st == \old(c_dr_st))) && (\result == 0))) || !((c_num_read == 0))) || !((q_free == 0))) && (((((!((2 == \old(c_dr_st))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((__retres1 == 0) && (\result == 0))) || !(((c_num_read + 1) == p_num_write)))) && (((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) && ((((!((2 == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) [2023-11-06 22:03:04,947 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!((2 == \old(c_dr_st))) || (((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (\result == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !(((c_num_read + 1) == p_num_write))) && ((((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) && (\result == 0)) || !((p_num_write == 1))) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0)))) && (((((!((2 == \old(c_dr_st))) || ((c_dr_st == 2) && (p_dw_st == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) && (((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) [2023-11-06 22:03:04,947 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!((2 == \old(c_dr_st))) || (((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (\result == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !(((c_num_read + 1) == p_num_write))) && ((((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) && (\result == 0)) || !((p_num_write == 1))) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0)))) && (((((!((2 == \old(c_dr_st))) || ((c_dr_st == 2) && (p_dw_st == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) && (((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) [2023-11-06 22:03:05,005 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__retres1 == 0) || !((2 == \old(c_dr_st)))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !(((c_num_read + 1) == p_num_write))) && ((((((!((p_num_write == 1)) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (((\old(p_dw_st) == p_dw_st) && (__retres1 == 0)) && (c_dr_st == \old(c_dr_st))))) && (((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) && ((((!((2 == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) [2023-11-06 22:03:05,005 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!((p_num_write == 1)) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || ((((\old(p_dw_st) == p_dw_st) && (__retres1 == 0)) && (c_dr_st == \old(c_dr_st))) && (\result == 0))) || !((c_num_read == 0))) || !((q_free == 0))) && (((((!((2 == \old(c_dr_st))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((__retres1 == 0) && (\result == 0))) || !(((c_num_read + 1) == p_num_write)))) && (((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) && ((((!((2 == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) [2023-11-06 22:03:05,005 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!((2 == \old(c_dr_st))) || (((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (\result == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !(((c_num_read + 1) == p_num_write))) && ((((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) && (\result == 0)) || !((p_num_write == 1))) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0)))) && (((((!((2 == \old(c_dr_st))) || ((c_dr_st == 2) && (p_dw_st == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) && (((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) [2023-11-06 22:03:05,006 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!((2 == \old(c_dr_st))) || (((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (\result == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !(((c_num_read + 1) == p_num_write))) && ((((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) && (\result == 0)) || !((p_num_write == 1))) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0)))) && (((((!((2 == \old(c_dr_st))) || ((c_dr_st == 2) && (p_dw_st == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) && (((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) [2023-11-06 22:03:05,038 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:03:05,039 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:03:05,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:03:05,040 INFO L158 Benchmark]: Toolchain (without parser) took 12539.62ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 100.6MB in the beginning and 169.0MB in the end (delta: -68.4MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2023-11-06 22:03:05,040 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 102.8MB. Free memory was 54.4MB in the beginning and 54.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:03:05,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.20ms. Allocated memory is still 144.7MB. Free memory was 100.1MB in the beginning and 87.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:03:05,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.11ms. Allocated memory is still 144.7MB. Free memory was 87.7MB in the beginning and 85.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:05,041 INFO L158 Benchmark]: Boogie Preprocessor took 31.90ms. Allocated memory is still 144.7MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:05,042 INFO L158 Benchmark]: RCFGBuilder took 505.35ms. Allocated memory is still 144.7MB. Free memory was 84.3MB in the beginning and 69.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:03:05,042 INFO L158 Benchmark]: TraceAbstraction took 11399.75ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 68.4MB in the beginning and 177.4MB in the end (delta: -108.9MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2023-11-06 22:03:05,043 INFO L158 Benchmark]: Witness Printer took 146.19ms. Allocated memory is still 251.7MB. Free memory was 177.4MB in the beginning and 169.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:03:05,045 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.33ms. Allocated memory is still 102.8MB. Free memory was 54.4MB in the beginning and 54.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.20ms. Allocated memory is still 144.7MB. Free memory was 100.1MB in the beginning and 87.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.11ms. Allocated memory is still 144.7MB. Free memory was 87.7MB in the beginning and 85.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.90ms. Allocated memory is still 144.7MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 505.35ms. Allocated memory is still 144.7MB. Free memory was 84.3MB in the beginning and 69.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11399.75ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 68.4MB in the beginning and 177.4MB in the end (delta: -108.9MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 146.19ms. Allocated memory is still 251.7MB. Free memory was 177.4MB in the beginning and 169.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1182 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 3487 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2291 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 715 IncrementalHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 1196 mSDtfsCounter, 715 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 605 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1086occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 722 PreInvPairs, 898 NumberOfFragments, 1720 HoareAnnotationTreeSize, 722 FomulaSimplifications, 4733 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7855 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1026 ConstructedInterpolants, 0 QuantifiedInterpolants, 1904 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1108 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 270/342 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) || (((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (c_dr_pc == 0))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((!((p_num_write == 1)) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || ((((\old(p_dw_st) == p_dw_st) && (__retres1 == 0)) && (c_dr_st == \old(c_dr_st))) && (\result == 0))) || !((c_num_read == 0))) || !((q_free == 0))) && (((((!((2 == \old(c_dr_st))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((__retres1 == 0) && (\result == 0))) || !(((c_num_read + 1) == p_num_write)))) && (((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) && ((((!((2 == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((__retres1 == 0) || !((2 == \old(c_dr_st)))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !(((c_num_read + 1) == p_num_write))) && ((((((!((p_num_write == 1)) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (((\old(p_dw_st) == p_dw_st) && (__retres1 == 0)) && (c_dr_st == \old(c_dr_st))))) && (((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) && ((((!((2 == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((((((((!((2 == \old(c_dr_st))) || (((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (\result == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !(((c_num_read + 1) == p_num_write))) && ((((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) && (\result == 0)) || !((p_num_write == 1))) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0)))) && (((((!((2 == \old(c_dr_st))) || ((c_dr_st == 2) && (p_dw_st == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) && (((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) || (((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0))) || (((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0))) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((!((2 == \old(c_dr_st))) || (((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (\result == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !(((c_num_read + 1) == p_num_write))) && ((((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) && (\result == 0)) || !((p_num_write == 1))) || !((c_dr_pc == 0))) || !((p_dw_pc == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0)))) && (((((!((2 == \old(c_dr_st))) || ((c_dr_st == 2) && (p_dw_st == 0))) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == 2))) || !(((c_num_read + 1) == p_num_write)))) && (((((((((\old(p_dw_st) == p_dw_st) && (tmp == 0)) && (c_dr_st == \old(c_dr_st))) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (\old(p_dw_st) < 2))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:03:05,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a504a5-fefd-44b3-a127-f2a51caf2d1b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE